Turing Machines and Understanding Computational Complexity
P. M. B. Vitanyi (National Research Center for Mathematics and, Computer Science in the Netherlands (CWI))
TL;DR
This paper discusses the Turing Machine's fundamental role in understanding computational complexity, highlighting its influence on the development of computation theory and complexity analysis.
Contribution
It provides an overview of the Turing Machine's significance and its impact on the evolution of computational complexity theory.
Findings
Turing Machines are central to defining computational complexity.
The paper illustrates the influence of Turing Machines on computation theory.
It emphasizes the importance of Turing Machines in understanding computational limits.
Abstract
We describe the Turing Machine, list some of its many influences on the theory of computation and complexity of computations, and illustrate its importance.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Quantum Computing Algorithms and Architecture · Cellular Automata and Applications