$50 = Free Delivery! No Code Needed
Shopping Cart
Turing's Vision: The Birth of Computer Science | MIT Press Book | History of Computing, Alan Turing Biography | Perfect for Computer Science Students & Tech Enthusiasts
Turing's Vision: The Birth of Computer Science | MIT Press Book | History of Computing, Alan Turing Biography | Perfect for Computer Science Students & Tech Enthusiasts

Turing's Vision: The Birth of Computer Science | MIT Press Book | History of Computing, Alan Turing Biography | Perfect for Computer Science Students & Tech Enthusiasts

$16.46 $21.95 -25% OFF

Free shipping on all orders over $50

7-15 days international

11 people viewing this product right now!

30-day free returns

Secure checkout

42697116

Guranteed safe checkout
amex
paypal
discover
mastercard
visa
apple pay

Description

An accessible and fascinating exploration of how Alan Turing’s mathematical theory gave rise to modern computer science and applications—from the desktops to cell phones In 1936, when he was just 24 years old, Alan Turing wrote a remarkable paper in which he outlined the theory of computation, laying out the ideas that underlie all modern computers. This groundbreaking and powerful theory now forms the basis of computer science. In Turing’s Vision, Chris Bernhardt explains the theory for the general reader, beginning with its foundations and systematically building to its surprising conclusions. He also views Turing’s theory in the context of mathematical history, other views of computation (including those of Alonzo Church), Turing’s later work, and the birth of the modern computer. Turing wanted to show that there were problems that were beyond any computer’s ability to solve; in particular, he wanted to find a decision problem that he could prove was undecidable. To explain Turing’s ideas, Bernhardt examines 3 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.

Reviews

******
- Verified Buyer
The author has an amazing ability to explain for people like me that have a little background in mathematical logic.Out of the chapter on Lambda calculus in which explanations aren't long enough (I needed to learn from other books and spent a lot of time), the book is very understandable and deserves more than five stars.
We use cookies to enhance your browsing experience, serve personalized ads or content, and analyze our traffic. By clicking "Allow cookies", you consent to our use of cookies. More Information see our Privacy Policy.
Top