Computability, Solvability, and the Halting Problem

  • Alan P. Parkes


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.


Turing Machine Formal Language Computable Function Abstract Machine Membership Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2002

Authors and Affiliations

  • Alan P. Parkes
    • 1
  1. 1.Distributed Multimedia Research Group, Computing DepartmentLancaster UniversityLancaster

Personalised recommendations