The Universal Machine
The Universal Machine
This chapter covers the development of computing, from its origins, with the analytical engine, to modern computer science. Babbage and Ada Lovelace’s contributions to the science of computing led, in time, to the idea of universal computers, proposed by Alan Turing. These universal computers, proposed by Turing, are conceptual devices that can compute anything that can possibly be computed. The basic concepts created by Turing and Church were further developed to create the edifice of modern computer science and, in particular, the concepts of algorithms, computability, and complexity, covered in this chapter. The chapter ends describing the Church-Turing thesis, which states that anything that can be computed can be computed by a Turing machine.
Keywords: Analytical engine, Turing machines, Algorithms, Computability, Complexity, Curch-Turing thesis
MIT Press Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
Please, subscribe or login to access full text content.
If you think you should have access to this title, please contact your librarian.
To troubleshoot, please check our FAQs, and if you can't find the answer there, please contact us.