Given a language that is Turing-Decidable, if you add the empty string to the language then is the new language Turing-Decidable?
I am very confused at this problem because from my understanding the halting states cannot transition to any other state, and in order to accept the empty string your start state would need to be your accept state.