ABSTRACT
Our definition of an algorithm is a Turing machine that decides a language-that is one that always halts by entering its accept or reject state as appropriate.
Now it is time to tackle what it means to be undecidable. This will take some effort to prove, and also will take effort to understand the proof when we have it. First, we need to lay some groundwork.
