Picture 1 of 1

Gallery
Picture 1 of 1

Have one to sell?
Turing's Vision: The Birth of Computer Science by Bernhardt, Chris, paperback,
US $8.99
ApproximatelyS$ 11.75
Condition:
3 available
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
US $3.99 (approx S$ 5.21) USPS Media MailTM.
Located in: Minneapolis, Minnesota, United States
Delivery:
Estimated between Sat, 22 Nov and Wed, 26 Nov 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:136022379006
Item specifics
- Condition
- Book Title
- Turing's Vision: The Birth of Computer Science
- 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 (21,032)
- o***5 (33)- Feedback left by buyer.Past 6 monthsVerified purchaseThe book was in the condition as described, so I wasn't expecting much. But actually it was in pretty good shape for my standards, I was surprised. Furthermore the book was sent in a cardboard box to protect it from damage during shipment. This box was evidence of the seller's intent to deliver a good product and I will definitely be going to this seller before other in the future.
- u***a (60)- Feedback left by buyer.Past 6 monthsVerified purchaseThe item was as described, shipped on time, and packed well. The seller even quickly responded to an address change I had to do! I have no complaints here :) Would buy again!!The Complete Book of Scales, Chords, Arpeggios and Cadences: Includes All the (#146568594722)
- h***3 (534)- Feedback left by buyer.Past monthVerified purchaseHit & miss shipping. Quick customer service response. Requested cardboard mailer for softcover book when buying, was to be a gift. Their shipping is the same if it is a cardboard mailer or a bubble mailer, $3.99. The book arrived damaged, bubble mailer torn. They offered a discount for damaged book & missing shipping request. I accepted but still disappointed, as I will have to buy it again. Last week different order was shipped in cardboard mailer item, arrived perfect no damage as described.

