Computability, Solvability, and the Halting Problem

  • Alan P. Parkes

Abstract

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.

Keywords

Expense 

Preview

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