Turing machines

Turing machines

For access to this article, please select a purchase option:

Buy chapter PDF
(plus tax if applicable)
Buy Knowledge Pack
10 chapters for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Handbook of Mathematical Models for Languages and Computation — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In the article, there exists a crucially important hypothesis, referred to as the Church -Turing thesis, saying that every effective computation is mechanically performable by a procedure if and only if it is carried out by a Turing machine. Consequently, any computation beyond the power of Turing machines is also beyond the power of any computer. Therefore, these machines are central to the study of computation from a practical, mathematical, logical, as well as philosophical standpoint.

Chapter Contents:

  • 8.1 Turing machines and their languages
  • 8.2 Determinism
  • 8.3 Universalness
  • 8.3.1 Turing machine codes
  • 8.3.2 Construction of universal Turing machines

Inspec keywords: Turing machines

Other keywords: Turing machine; Church-Turing thesis

Subjects: Automata theory

Preview this chapter:
Zoom in

Turing machines, Page 1 of 2

| /docserver/preview/fulltext/books/pc/pbpc026e/PBPC026E_ch8-1.gif /docserver/preview/fulltext/books/pc/pbpc026e/PBPC026E_ch8-2.gif

Related content

This is a required field
Please enter a valid email address