Computability, Solvability, and the Halting Problem
This chapter investigates the limitations of the Turing machines (TM). The limitations of the TM are, by Turing’s thesis (introduced in the last chapter), also the limitations of the digital computer.
KeywordsTuring Machine Formal Language Computable Function Abstract Machine Membership Problem
Unable to display preview. Download preview PDF.