Picture 1 of 1

Gallery
Picture 1 of 1

Have one to sell?
Turing's Vision : The Birth of Computer Science by
US $26.04
ApproximatelyRM 108.08
Condition:
More than 10 available
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
Free DGM SmartMail Ground.
Located in: Avenel, New Jersey, United States
Delivery:
Estimated between Wed, 3 Dec and Wed, 10 Dec to 94104
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Shop with confidence
About this item
Seller assumes all responsibility for this listing.
eBay item number:365587992095
Item specifics
- Condition
- Brand New: A new, unread, unused book in perfect condition with no missing or damaged pages. See all condition definitionsopens in a new window or tab
- ISBN
- 9780262533515
About this product
Product Identifiers
Publisher
MIT Press
ISBN-10
0262533510
ISBN-13
9780262533515
eBay Product ID (ePID)
228915011
Product Key Features
Number of Pages
208 Pages
Language
English
Publication Name
Turing's Vision : the Birth of Computer Science
Publication Year
2017
Subject
Programming / Algorithms, Cultural Heritage, Computer Science, History, Computer Engineering, Science & Technology
Type
Textbook
Subject Area
Computers, Biography & Autobiography
Format
Trade Paperback
Dimensions
Item Height
0.7 in
Item Weight
7.6 Oz
Item Length
11.1 in
Item Width
5.4 in
Additional Product Features
Intended Audience
Trade
LCCN
2015-039955
Dewey Edition
23
Illustrated
Yes
Dewey Decimal
510.92 B
Synopsis
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., 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., Turing's fascinating and remarkable theory, which now forms the basis of computer science, explained for the general reader. 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 reader. Bernhardt argues that the strength of Turing's theory is its simplicity, and that, 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 context 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 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.
LC Classification Number
QA29.T8A57 2016
Item description from the seller
Seller feedback (11,533)
- s***8 (7702)- Feedback left by buyer.Past monthVerified purchaseS L O W S H I P P I N G! Bought it on 10/25. Waited a week and no update so I emailed. The seller mailed it a few days later on 11/4 and it finally arrived on 11/12. Item as described. Honest sellers just very slow.
- s***o (305)- Feedback left by buyer.Past monthVerified purchaseThe item’s appearance is much better than I expected. The physical condition is exactly as described in the listing. In my honest opinion, the quality of this item makes this the perfect addition to my collection. The value of this transaction was increased due to the seller’s prompt responses in securely packaging and shipping the item. Thank you for the opportunity to purchase this! I recommend this seller and I’ve added the seller to my Follow List.
- v***v (25)- Feedback left by buyer.Past 6 monthsVerified purchaseSeller responded quickly to all questions, but it took a week to ship and another 10 days for delivery. The item matches the description, so if shipping time is not critical, this seller can be recommended.Art of Awakening : a User's Guide to Tibetan Buddh (#363985000935)
More to explore :
- Computer Science Textbooks,
- Computer Science Textbooks in English,
- Computer Science Hardcover Textbooks,
- Computer Science Paperback Textbooks,
- Science Magazines,
- Science Fiction Fiction Fiction & Books,
- Science Fiction Magazines,
- Science Audiobook Audiobooks,
- Science Study Guides & Test Prep,
- Nonfiction Science Fiction & Nonfiction Books

