Theory of computation - Wikipedia
This Wikipedia page provides a comprehensive overview of the theory of computation, covering its central areas such as automata theory, formal language theory, computability theory, and computational complexity theory. It introduces various models of computation, including the Turing machine, and discusses their equivalencies.
概览
收录于
2026年3月17日
学科与领域
computer-science-fundamentals · theory-of-computation
年级范围
九年级（高一）–十二年级（高四）
页面类型
Wiki
简介
Theory of Computation
- Core Definition: The branch of theoretical computer science and mathematics that explores the fundamental capabilities and limitations of computers, focusing on what problems can be solved, how efficiently, and to what degree of precision.
- Three Major Branches:
- Automata Theory and Formal Languages: The study of abstract machines (automata) and the formal languages they can recognize.
- Computability Theory: Investigates the extent to which problems are solvable; famously establishes that some problems (e.g., the Halting Problem) are undecidable.
- Computational Complexity Theory: Analyzes the efficiency of algorithms, specifically time and space requirements, often using Big O notation.
- Key Model of Computation: The Turing machine is the most commonly examined model due to its simplicity, analytical power, and status as the standard for "reasonable" computation (Church–Turing thesis).
- Chomsky Hierarchy: A classification of formal languages and their corresponding automata:
- Type-0: Recursively enumerable (Turing machine)
- Type-1: Context-sensitive (Linear-bounded non-deterministic Turing machine)
- Type-2: Context-free (Non-deterministic pushdown automaton)
- Type-3: Regular (Finite-state automaton)
- Notable Concepts & Results:
- P vs. NP: A major open problem in computer science regarding whether certain problems can be solved efficiently; it is one of the seven Millennium Prize Problems.
- Halting Problem: Proves that some problems are impossible to solve using a Turing machine.
- Rice's Theorem: States that all non-trivial properties of partial functions are undecidable.
- Alternative Models of Computation: Lambda calculus, Combinatory logic, μ-recursive functions, Markov algorithms, and Register machines.
- Historical Context:
- Pioneers: Ramon Llull, Alonzo Church, Kurt Gödel, Alan Turing, Stephen Kleene, Rózsa Péter, John von Neumann, and Claude Shannon.
- Professional Milestones: FOCS (1960), STOC (1969), and awards like the Gödel Prize (1993) and Knuth Prize (1996).
用户评价
暂无已发布的评价，欢迎率先分享您的使用体验。