Turing's Vision: The Birth of Computer Science (Mit Press),Used

Turing's Vision: The Birth of Computer Science (Mit Press),Used

In Stock
SKU: SONG0262533510
Brand: MIT Press
Regular price$15.59
Quantity
Add to wishlist
Add to compare

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

An accessible and fascinating exploration of how Alan Turings mathematical theory gave rise to modern computer science and applicationsfrom the desktops to cell phonesIn 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 Turings Vision, Chris Bernhardt explains the theory for the general reader, beginning with its foundations and systematically building to its surprising conclusions. He also views Turings theory in the context of mathematical history, other views of computation (including those of Alonzo Church), Turings later work, and the birth of the modern computer.Turing wanted to show that there were problems that were beyond any computers ability to solve; in particular, he wanted to find a decision problem that he could prove was undecidable. To explain Turings ideas, Bernhardt examines 3 wellknown 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 Turings problem concerning computable numbers.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed