"On Computable Numbers, with an Application to the Entscheidungsproblem”, Alan Turing’s paper of 1937, contained his thesis that every effective computation can be programmed on such an automation as that called Turing machine. Furthermore it proved the unsolvability of the halting problem and of the decision problem for first order logic, and it presented the invention of the universal Turing machine. It is that publication that will presumably be acknowledged as marking sub specie aeternitatis the beginning of the "computer age”. This volume recognizes the still continuing influence of the Turing machine concept by collecting contributions from international specialists in logic, computability, mathematics, biology, physics, linguistics, and cognitive science, thus signalling the exceptionally wide scope of that concept.
FREE Two-Day Shipping for Students. Learn more |
| ||||||||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
synchronous parallel procedure, cascade automata, transformability problem, use auto land, effective computational efficiency, hounded resources, gradual transformability, nonprogrammable systems, recursive strength, quantum set theory, cellular automaton dynamics, structural programmability, skeletal game, random isomorphic copy, ordinal logics, slow growth law, quantum complex, general recursiveness, algorithmic probability, external strings, effective calculability, situation schema, scanned square, evolutionary adaptability, quantum topology Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Church's Thesis, Lecture Notes, Alan Turing, Oxford University Press, Theory of Computing, Collected Works, North-Holland Publ, Pergamon Press, Raven Press, Cambridge University Press, Fifth Generation, North-Holland Puhl, Academic Press, The Undecidable, London Mathematical Society, Busy Beaver Game, Englewood Cliffs, Second World War, Lady Lovelace, University of Illinois Press, Princeton University Press, Stanford University, Bletchley Park, Fine Hall New!
Concordance | Text Stats Browse Sample Pages:
Front Cover | Front Flap | Table of Contents | First Pages | Back Flap | Back Cover | Surprise Me!
synchronous parallel procedure, cascade automata, transformability problem, use auto land, effective computational efficiency, hounded resources, gradual transformability, nonprogrammable systems, recursive strength, quantum set theory, cellular automaton dynamics, structural programmability, skeletal game, random isomorphic copy, ordinal logics, slow growth law, quantum complex, general recursiveness, algorithmic probability, external strings, effective calculability, situation schema, scanned square, evolutionary adaptability, quantum topology Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Church's Thesis, Lecture Notes, Alan Turing, Oxford University Press, Theory of Computing, Collected Works, North-Holland Publ, Pergamon Press, Raven Press, Cambridge University Press, Fifth Generation, North-Holland Puhl, Academic Press, The Undecidable, London Mathematical Society, Busy Beaver Game, Englewood Cliffs, Second World War, Lady Lovelace, University of Illinois Press, Princeton University Press, Stanford University, Bletchley Park, Fine Hall New!
Concordance | Text Stats Browse Sample Pages:
Front Cover | Front Flap | Table of Contents | First Pages | Back Flap | Back Cover | Surprise Me!
Citations (learn more)
39
books
cite this book:
See all 39 books citing this book
- From Writing To Computers by Julian Warner on 4 pages
- Complexity, Entropy and the Physics of Information by Wojciech H. Zurek on page 21, and page 148
- Automata, Languages and Programming: 20th International Colloquium, ICALP 93, Lund, Sweden, July 5-9, 1993. Proceedings (Lecture Notes in Computer Science) by Andrzej Lingas on page 202, and page 287
- Artificial Life II (Santa Fe Institute Studies in the Sciences of Complexity Proceedings) by Christopher G. Langton on page 208, and page 253
- Constructivity in Computer Science: Summer Symposium, San Antonio, TX, June 19-22, 1991. Proceedings (Lecture Notes in Computer Science) by J.Paul Jr. Myers on page 215, and page 216
See all 39 books citing this book
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product).
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
|
|
So You'd Like to...
Look for Similar Items by Category
- Books > Computers & Technology > Computer Science > Artificial Intelligence > Theory of Computing
- Books > New & Used Textbooks > Computer Science > Artificial Intelligence
- Books > New & Used Textbooks > Humanities > Philosophy > Ethics
- Books > New & Used Textbooks > Science & Mathematics > Mathematics
- Books > Politics & Social Sciences > Philosophy
- Books > Science & Math > Mathematics
