Turing’s Thesis and the Universality of the Turing Machine

  • Alan P. Parkes

Abstract

In this chapter, we investigate Turing’s thesis, which essentially says that the Turing machine (TM) is the most powerful computational device of all. We find evidence to support the thesis by considering a special TM called the Universal TM (UTM).

Keywords

Posit Prefix Clarification Cute 

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