book · The MIT Press eBooks · 2017

The Universal Machine

Arlindo L. Oliveira · 0 citations

View original publication →

See where this sits in the topic map →

Summary AI-generated

TL;DR
This chapter traces the history of computing from the early analytical engine to the foundations of modern computer science.
Problem
Not specified in the abstract.
Method
Not specified in the abstract.
Results
Not specified in the abstract.
Contributions
The foundational work of Babbage and Ada Lovelace paved the way for Alan Turing's conceptualization of universal computers.
Limitations
Not specified in the abstract.
Takeaways
The chapter outlines the development of algorithms, computability, and complexity, concluding with the Church-Turing thesis.
Applications
Not specified in the abstract.
Topics
The Universal Machine; History of Computing; Computer Science Foundations
For industry
Not specified in the abstract.
Why it matters
Not specified in the abstract.

Abstract

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.

← All publications