Turing's Vision

Turing's Vision : The Birth of Computer Science

4.28 (89 ratings by Goodreads)
By (author) 

List price: US$55.00

Currently unavailable

We can notify you when this item is back in stock

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks

Description

In 1936, when he was just twenty-four 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, Turing's most important contribution, for the general listener. Bernhardt argues that the strength of Turing's theory is its simplicity, and explained in a straightforward manner, it is eminently understandable by the nonspecialist. As Marvin Minsky writes, "The sheer simplicity of the theory's foundation and extraordinary short path from this foundation to its logical and surprising conclusions give the theory a mathematical beauty that alone guarantees it a permanent place in computer theory." Bernhardt begins with the foundation and systematically builds to the surprising conclusions. He also views Turing's theory in the contexts of mathematical history, other views of computation (including those of Alonzo Church), Turing's later work, and the birth of the modern computer.In the paper "On Computable Numbers, with an Application to the Entscheidungsproblem," Turing thinks carefully about how humans perform computation, breaking it down into a sequence of steps, and then constructs theoretical machines capable of performing each step. 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 explores the concept of undecidability by examining three well-known decision problems; investigates theoretical computing machines, including Turing machines; explains universal machines; and proves that certain problems are indeed undecidable, including Turing's problem concerning computable numbers.
show more

Product details

  • CD-Audio
  • 129.54 x 144.27mm
  • English
  • Unabridged
  • Unabridged
  • 1504711718
  • 9781504711715

Rating details

89 ratings
4.28 out of 5 stars
5 49% (44)
4 34% (30)
3 13% (12)
2 2% (2)
1 1% (1)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X