Goodreads helps you keep track of books you want to read.
Start by marking “The Annotated Turing: A Guided Tour Through Alan Turing's Historic Paper on Computability and the Turing Machine” as Want to Read:
The Annotated Turing: A Guided Tour Through Alan Turing's Historic Paper on Computability and the Turing Machine
Enlarge cover
Rate this book
Clear rating
Open Preview

The Annotated Turing: A Guided Tour Through Alan Turing's Historic Paper on Computability and the Turing Machine

4.11 of 5 stars 4.11  ·  rating details  ·  319 ratings  ·  23 reviews
Programming Legend Charles Petzold unlocks the secrets of the extraordinary and prescient 1936 paper by Alan M. TuringMathematician Alan Turing invented an imaginary computer known as the Turing Machine; in an age before computers, he explored the concept of what it meant to be "computable," creating the field of computability theory in the process, a foundation of present ...more
Paperback, 372 pages
Published June 1st 2008 by John Wiley & Sons
more details... edit details

Friend Reviews

To see what your friends thought of this book, please sign up.

Reader Q&A

To ask other readers questions about The Annotated Turing, please sign up.

Be the first to ask a question about The Annotated Turing

Structure and Interpretation of Computer Programs by Harold AbelsonIntroduction to Algorithms by Thomas H. CormenThe C Programming Language by Brian W. KernighanThe Pragmatic Programmer by Andrew HuntArt of Computer Programming, The, Volumes 1-3 Boxed Set by Donald Ervin Knuth
Essential Books of Computer Science
53rd out of 144 books — 103 voters
Code Complete by Steve McConnellThe Pragmatic Programmer by Andrew HuntStructure and Interpretation of Computer Programs by Harold AbelsonThe C Programming Language by Brian W. KernighanIntroduction to Algorithms by Thomas H. Cormen
To-Read for Programmers
51st out of 87 books — 1 voter

More lists with this book...

Community Reviews

(showing 1-30 of 1,691)
filter  |  sort: default (?)  |  rating details
Wouldn't you like to know the outcome of your actions before you decide what to do? Looking into the future, you could see if biting that apple was a good idea or something completely different and unexpected.

However, there's no way through it but to do it.

Well mathematicians and computer programmers have the same problem. British mathematician, Alan Turing, proved that there is no way a computer can be designed with the correct set of instructions (program) so as to be able to determine if any
This is one of those books that is so deep that I doubt anyone can read it cover to cover without having to go back and puzzle over the contents of some of the chapters. It is intended as a commentary on Turing's paper which, in some ways, due to the notation Turing uses, is more difficult to understand than it needs to be. Petzold plows through this giving several lines of commentary and examples to each line of Turing's paper.

Petzold demonstrates his knowledge of computing and mathematics and
Nick Black
Amazon 2008-10-24. This book needed to decide earlier on whether it was going to be pop-CS or a real book. There's some great insights here -- I finally feel that I truly know the difference now, in a deep sense, of what makes a given transcendental number computable or not (there's unfortunately rather little detail on computable functions themselves, but that's an easy extension from computable numbers). Kudos to Petzold for his fine background material on Hilbert's erweiterte Funktionenkalkul ...more
Mengsen Zhang
Jun 25, 2015 Mengsen Zhang rated it 4 of 5 stars
Recommended to Mengsen by: Roadzhang
Nice book! If you think this book is just an annotated version of Turing's paper on Computable numbers & Entscheidungsproblem, you're probably gonna be frustrated to see a paper of 30-ish pages has been stretched out into over 300 pages. However, it's more like that you traveled back in time to visit Turing and he (and his machine) introduced you to the most beautiful intellectual epics surrounding those decades. The dreams and dramas about numbers haunt human thoughts forever, at least sinc ...more
It was about 10 years ago when I first found Turing's original paper on Internet and thought it wouldn't be so hard to read and understand it (after all its "mere" computer science). Since then I've tried to digest it quite a few times on and off and never actually succeeded. Infect most of the time I got stuck on few nitty-gritty and just couldn't move forward. I have even bought/borrowed almost all books on the subject that falls in to "popular science" types. Needless to say, like many such b ...more
This is a wonderful book. Petzold does a line by line exegesis of Turing's 1936 paper on computability, explaining the historical and mathematical background, and showing illustrative examples. The book is probably most interesting to computer programmers, but would also be of interest to anyone interested in mathematics or the history of computer technology. Having attempted to read Turing's paper several years ago, I found that this book really closed my gaps in understanding.
Very useful for making it through Turing's famous (and dense) paper. Petzold sets the context for the paper and draws out its implications for thought. Turing invented the Turing machine on his way to showing that there is no general decision procedure for determining the logical validity of a statement. You may not care about all the math needed to get to this point, but it's there if you want it.
outstanding refresher on how math theory lead to computing. makes the seminal turing paper understandable.
This book turns Turing's rather terse paper into a great introduction to computable real numbers.
I was reminded that I prefer to learn the stories behind mathematicians more then I like to try to understand the math. Parts of this were a walk down memory lane such as the parts quoted from The Enigma by Hodge which I enjoyed. I also enjoyed the discussion on what it meant and the discussion on how Turing's ideas are still being used in ideas on how the mind and the universe work. As far as the math explanations were concerned I think the author did a good job going step by step explaining th ...more
This book has a 10:1 ratio of annotations to Turing's original paper. That's a considerable increase. But there's no wasted space here. The biography of Alan Turing is very short. Only the bare minimum of each mathematical subject is explained (Diophantine equations, number theory, sets, lambda calculus). In short, Petzold added just the right amount of notes for a non-mathematician like myself to actually understand every single word of Turning's original 36 page paper.

It seems that I am practi
In this book, Charles Petzold guides the reader through Alan Turing's famous paper on computability, which introduced the world to what is now known as the "Turing machine".

Along the way, in this pleasantly written book, the author places the paper in a historical setting, which in part extends back to the Greek mathematician Diophantus, and provides numerous insights into the development of ideas that led up to Turing's paper, as well as numerous anecdotes of Turing's brief career. Turing's ca
Kam-Yung Soh
An impressive book that gives you an annotated guide through Turing's historic paper on computation. It starts with a background in mathematics and number theory, defining various concepts that are required to understand the paper.

Next, the author covers probably the part that most interest me: Turing machines. Turing shows how such machines can be used to perform computation and, in an impressive series of steps, shows how a Universal machine can be used to execute the operations of any Turing
The Annotated Turing una lettura piuttosto difficile per via di una certa complessit "matematica" di una intera sezione del libro: per lo stesso una lettura affascinante per come riesce a guidare il lettore all'interno di una serie di discussioni lunghe diversi decenni legate anche al mondo dell'informatica. Lo consiglio se vi interessa la materia. ...more
Amar Pai
I was interested to learn that the term "Halting Problem" does not actually appear in Turing's paper.

Indeed, his definition of "computable" applied to numbers is sort of the opposite: a computable number is a number that can be expressed as the output of a program that never stops printing digits (i.e. pi is computable because you can write a Turing number representing a program that prints 3.1415... etc to an arbitrary # degrees precision.) By this definition all real numbers are computable. (
An excellent book and a compelling read. Primarily, obvious from the title, a deep dive into Turing's seminal paper the book goes far afield onto the maths necessary to understand the problem and beyond. So, while no previous technical or mathematical knowledge is strictly required the books will mainly appeal to those of that mindset.

Except for the penultimate chapter, "Is Everything A Turing Machine?" Petzold takes us through a tour of mathematical and philosophical history eventually conflat
Matthew Haney
I absolutely love this book, but a lot of the logic and notation that is used by Turing is difficult to comprehend, particularly towards the end. Even the authors explanations don't help too greatly, and his "simplified" computations are just as complicated as Turing's.

I'd recommend it to anyone who (like me) is interested in trying to program a Turing machine or (not like me) is VERY well-versed and interested in logic and computational analysis. Otherwise, this book will take you a year to rea
This book is exactly what it says it is, a very well annotated version of the paper where Alan Turing introduced the machine that bears his name and sketched the limits of computing. The full text of the paper is included, set apart from the explanations and background research by a shaded background. The explanations are detailed and clear. The historical background information is relevant and interesting. In under 400 pages the reader is led to understanding one of the most important academic ...more
Rik Eberhardt
So far (7 Dec 02008) I've finished the introduction and have started in on the meat - Turing's paper itself. The first few chapters were great - basically, a quick recap of algebra and set theory. I'll update once I finish - I kinda got sidetracked into reading Cryptonomicon (I've owned it since 01999 but never got around to reading it).
Jason Dew
Very good book on Turing's famous paper but my favorite part was the ancillary coverage of mathematicians and computer scientists that were influenced by the Turing machine.
Entscheidungsproblem!!! gave up half way through, but i still think i might have learned a little bit. Petzold's other book "Code" is my favorite computer book.
A fantastic exposition of a crucially important though relatively obscure fundamental of computer science.

A must read for every computer scientist.
Nikas marked it as to-read
Jul 30, 2015
Anil Behera
Anil Behera marked it as to-read
Jul 28, 2015
Diego marked it as to-read
Jul 28, 2015
Bob Deragisch
Bob Deragisch marked it as to-read
Jul 27, 2015
Gaurav Srivastava
Gaurav Srivastava marked it as to-read
Jul 27, 2015
Andrii Sydorchuk
Andrii Sydorchuk marked it as to-read
Jul 26, 2015
Caique Marques
Caique Marques is currently reading it
Jul 26, 2015
« previous 1 3 4 5 6 7 8 9 56 57 next »
There are no discussion topics on this book yet. Be the first to start one »
  • The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life Plus the Secrets of Enigma
  • Concepts, Techniques, and Models of Computer Programming
  • Types and Programming Languages
  • The Architecture of Open Source Applications, Volume II
  • Concrete Mathematics: A Foundation for Computer Science
  • A Discipline of Programming
  • Paradigms of Artificial Intelligence Programming: Case Studies in Common LISP
  • Purely Functional Data Structures
  • The Universal Computer: The Road from Leibniz to Turing
  • The Seasoned Schemer
  • Fluid Concepts and Creative Analogies
  • The Elements of Computing Systems: Building a Modern Computer from First Principles
  • Hacker's Delight
  • Information Theory, Inference and Learning Algorithms
  • Computers and Intractability: A Guide to the Theory of NP-Completeness
  • Programming Pearls
  • The Elements of Programming Style
  • Introduction to Automata Theory, Languages, and Computation

Goodreads is hiring!

If you like books and love to build cool products, we may be looking for you.
Learn more »
Code: The Hidden Language of Computer Hardware and Software Programming Windows Applications = Code + Markup: A Guide to the Microsoft® Windows® Presentation Foundation: A Guide to the Microsoft Windows Presentation Foundation Programming Windows 95 Programming Microsoft®  Windows® with C#

Share This Book