The Annotated Turing

The Annotated Turing

The Annotated Turing: A Guided Tour Through Alan Turing’s Historic Paper on Computability and the Turing Machine is a book by Charles Petzold, published in 2008 by John Wiley & Sons, Inc. Petzold annotates Alan Turing’s paper On Computable Numbers, with an Application to the Entscheidungsproblem. The book takes readers sentence by sentence through Turing’s paper providing explanations, further examples, corrections, and biographical information.

Table of Contents

* "Part I. Foundations"
* "Chapter 1: This Tomb Holds Diophantus"
* "Chapter 2: The Irrational and the Transcendental"
* "Chapter 3: Centuries of Progress"

* "Part II. Computable Numbers"
* "Chapter 4: The Education of Alan Turing"
* "Chapter 5: Machines at Work"
* "Chapter 6: Addition and Multiplication"
* "Chapter 7: Also Known as Subroutines"
* "Chapter 8: Everything is a Number"
* "Chapter 9: The Universal Machine"
* "Chapter 10: Computers and Computability"
* "Chapter 11: Of Machines and Men"

* "Part III. Das Entscheidungsproblem"
* "Chapter 12: Logic and Computability"
* "Chapter 13: Computable Functions"
* "Chapter 14: The Major Proof"
* "Chapter 15: The Lambda Calculus"
* "Chapter 16: Conceiving the Continuum "

* "Part IV. And Beyond"
* "Chapter 17: Is Everything a Turing Machine?"
* "Chapter 18: Diophantus Awakes!"

External links

* [http://theannotatedturing.com The book's website]
* [http://charlespetzold.com Charles Petzold's website]
* [http://www.turing.org.uk/ Alan Turing website maintained by Andrew Hodges]
* [http://www.alanturing.net/ The Turing Archive for the History of Computing]
* [http://www.turingarchive.org/ The Turing Digital Archive]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… …   Wikipedia

  • Alan Turing — Turing redirects here. For other uses, see Turing (disambiguation). Alan Turing Turing at the time of his election to Fellowship of the Royal Society …   Wikipedia

  • Charles Petzold — Born February 2, 1953 (1953 02 02) (age 58) New Brunswick, New Jersey Alma mater Stevens Institute of Technology …   Wikipedia

  • Turingmaschine — Die Turingmaschine ist ein von dem britischen Mathematiker Alan Turing 1936 entwickeltes Modell, um eine Klasse von berechenbaren Funktionen zu bilden. Sie gehört zu den grundlegenden Konzepten der Theoretischen Informatik. Das Modell wurde im… …   Deutsch Wikipedia

  • Simply typed lambda calculus — The simply typed lambda calculus (lambda^ o) is a typed interpretation of the lambda calculus with only one type combinator: o (function type). It is the canonical and simplest example of a typed lambda calculus. The simply typed lambda calculus… …   Wikipedia

  • History of logic — Philosophy ( …   Wikipedia

  • Logic — For other uses, see Logic (disambiguation). Philosophy …   Wikipedia

  • C++ — The C++ Programming Language, written by its architect, is the seminal book on the language. Paradigm(s) Multi paradigm:[1] procedural …   Wikipedia

  • Incompatible Timesharing System — Infobox OS name = Incompatible Timesharing System caption = developer = MIT Artificial Intelligence Laboratory and Project MAC source model = kernel type = supported platforms = PDP 6, PDP 10 ui = family = released = latest release version =… …   Wikipedia

  • Syntactic predicate — A syntactic predicate specifies the syntactic validity of applying a production in a formal grammar and is analogous to a semantic predicate that specifies the semantic validity of applying a production. It is a simple and effective means of… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”