Unsolvable Problems

  • John Stillwell
Part of the Graduate Texts in Mathematics book series (GTM, volume 72)


The concept of a Turing machine was introduced in 0.4.1, as a machine that controls a read/write head moving on an infinite tape. We shall now explain the concept in more detail and give a few examples that illustrate how Turing machines compute functions and solve problems.


Normal Form Word Problem Turing Machine Unsolvable Problem Complete State 
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 New York Inc. 1993

Authors and Affiliations

  • John Stillwell
    • 1
  1. 1.Department of MathematicsMonash UniversityClaytonAustralia

Personalised recommendations