Discrete or continuous - where mathematics and existential philosophical questions converge. Chapter 9: The Universal Machine. Petzold says as much in the Introduction. Alas, Alonzo Church beat him to the proof, but Turing's paper is published anyway. Your browser indicates if you've visited this linkEncuentra de C.
An impressive book that gives you an annotated guide through Turing's historic paper on computation. Perhaps that is an inescapable feature of a book like this: an historical paper such as Turing's it is not always the very best route to understanding. And then I wouldn't have been able to go around telling people that I'd read Turing's paper or been able to use the word Entscheidungsproblem, which is pretty much worth the price of admission right there. 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 machine. I guess what I'm trying to say is only a mathematician can fully enjoy this book. As Maurice Wilkes said: As soon as we started programming, we found out to our surprise that it wasn't as easy to get programs right as we had thought.
Unfortunately, because it is limited to using the conventions and structure given by Turing, this book was not as simple and elegant as I know Petzold could have been on his own. Chapter 14: The Major Proof. Charles is a great guide in this endeavor. To explain Turing's ideas, Bernhardt examines three well-known decision problems to explore the concept of undecidability; investigates theoretical computing machines, including Turing machines; explains universal machines; and proves that certain problems are undecidable, including Turing's problem concerning computable numbers. Your browser indicates if you've visited this linkDownload The Annotated Turing: A Guided Tour Through Alan Turings Historic Paper on Computability and the Turing Machine or any other file from Books category. This is an interesting book to read even if you just want to know a bit more about mathematics and Alan Turing. Impress your professors, read it this summer and dazzle them this fall.
The Annotated Turing: A Guided Tour Through Alan Turing's. This book actually does this step-by-step run explanation making it so easier to read and understand quickly. 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. The Education of Alan Turing Alan Turing reads books, gets smart, goes to Cambridge, gets smarter, and decides to tackle the Entscheidungsproblem. You should definitely send me a résumé if you can read the whole thing.
Chapter 7: Also Known as Subroutines. Computer programming legend and author of the highly acclaimed book Code: The Hidden History of Computer Hardware and Software takes readers on a journey through one of the seminal papers in the history of computing. Reading it unlocked something in me and has given me such a feeling of confidence that I believe there isn't anything I can't do. Chapter 15: The Lambda Calculus. So you end up with a finite number sometimes represent a infinite number. On the other hand 'On Computable Numbers, With An Application To The Entscheidungsproblem' is indeed a mathematics paper.
Looking forward to that email in May - 'Your Amazon. The Annotated Turing is an important addition to any Computer Science curriculum. I was simply shocked when I opened the book. This book was literally sitting on my nightstand for years. This was the perfect book for it. However, if anyone out there is a computer programmer or a math whiz, take a look at the book. I can hardly wait to read it because your skill as story-teller is first rate.
This book amazingly points them out and corrects even the minor misprints. I can remember the exact instant when I realized that a large part of my life from then on was going to be spent in finding mistakes in my own programs. The way the book is structured is just excellent: Historical context provided but optional, scary maths not simplified but explained and also optional. Nevertheless, this was an exellent book and I think this kind of text is how fundamental research should be presented much more often. Then undecidable number problem becomes undecidable predicate logic problem.
Tentative Table of Contents Page numbers shown in bold refer to the pages of Turing's original paper discussed in that chapter. Only the bare minimum of each mathematical subject is explained Diophantine equations, number theory, sets, lambda calculus. However, there's no way through it but to do it. Programming Legend Charles Petzold unlocks the secrets of the extraordinary and prescient 1936 paper by Alan M. The historical context, biographical stories, and overall summarization of Turing's paper is excellent and I thoroughly enjoyed those parts.
Your browser indicates if you've visited this link by Charles Petzoldhttps safaribooksonline. It was a wonderful experience when the concepts 'clicked. . You are inspiring me to return my attention to some related topics that I have wanted to explore and popularize for a long time. Download The Annotated Turing: A Guided Tour Through Alan Turing's Historic Paper on Computability and the Turing Machine Ebook The Annotated Turing: A Guided Tour Through Alan Turing's.
It is always fascinating at least to me to catch a glimpse of the vast implications of the mathematical abstractions underlying our modern world. But I am confident that absolutely anyone, if they spent enough time with it, would have no trouble working out the details of the Turing Machine and the concept of the computability of numbers as I did. Every time I felt that I didn't understand a particular definition or formula, Petzold's notes comes to the rescue. Chapter 11: Of Machines and Men. I'm glad I read this, but I won't be reading it again.