DeepRead
Cover of The Annotated Turing

The Annotated Turing

Charles Petzold · 2008

Minds, machines and the future › Turing and computing history

#555 most recommended

About the book

The book is a line-by-line walkthrough of Alan Turing's 1936 paper "On Computable Numbers, with an Application to the Entscheidungsproblem," which introduced the Turing machine. It explains the paper's notation and examples so that a reader can follow the original text, and it assumes only high school mathematics. Turing defines a computable number as one whose digits a machine can produce by following a finite set of mechanical rules, and he gives a simple machine model to make that idea precise. The paper shows that a single universal machine can simulate any other, and it uses this to argue that some questions about machines cannot be settled by any general procedure, which answers the Entscheidungsproblem negatively. Petzold's position is that the paper is readable on its own terms and that its core ideas underlie modern computing.

Written by Claude from what it knows of this book.

What Hacker News says 80% recommend · 0% critical

0102020092015202020262022 peak · 19
This bookAverage book in Turing and computing history

In the commenters’ own words

What Open Library readers say 4.40 from 5 ratings

  1. 53
  2. 41
  3. 31
  4. 20
  5. 10
  • 41 want to read
  • 3 reading
  • 5 have read

Only 5 ratings: treat the average as a hint.

Open Library’s page for the book

What Wikipedia says

  • published 2008
  • 372 pages
  • 219 views a month

Read the Wikipedia article

Reddit communities — coming later

The threads it came up in

Details

First published
2008
ISBN
9780470229057
Editions known
2 at Open Library
Open Library
OL9372188W

Computational complexityTuring machinesTuring, alan mathison, 1912-1954

Explore in the mosaic

Read next: its neighbours on the mosaic