The List of computability and complexity topics reference article from the English Wikipedia on 24-Jul-2004 (provided by Fixed Reference: snapshots of Wikipedia from wikipedia.org)

List of computability and complexity topics

This is a list of computability and complexity topics, by Wikipedia page.

Computability theory is the part of the theory of computation that deals with what can be computed, in principle. Computational complexity theory deals with how hard computations are, in quantitative terms, both with upper bounds (algorithms whose complexity in the worst cases, as use of computing resources, can be estimated), and from below (proofs that no procedure to carry out some task can be very fast).

For more abstract foundational matters, see the list of mathematical logic topics. See also list of algorithms, list of algorithm general topics.

Table of contents

1 Calculation 2 Computability theory: models of computation 3 Decision problems 4 Definability questions 5 Complexity theory 6 Complexity classes 7 Named problems 8 Extensions

Calculation

• Mathematical expression
  • Expression, expression (mathematics), evaluation
  • Bracket
  • Term (mathematics)
  • S-expression, M-expression
  • Four fours
• Lookup table, mathematical table, multiplication table
• Calculator
  • Counting rods
  • Abacus
  • Napier's bones
  • Slide rule
    • Common logarithm
  • Generating trigonometric tables
  • Difference engine
  • Analytical engine
  • Ada Byron's notes on the analytical engine
  • Adding machine
  • Mechanical calculator
  • Comptometer
  • Differential analyser
  • Curta calculator
  • History of computers
• Order of operations, infix notation, reverse Polish notation
• Multiplication algorithm
  • Peasant multiplication
• Division by two
• Exponentiating by squaring
• Addition chain
  • Scholz conjecture
• Presburger arithmetic

Computability theory: models of computation

• Algorithm
  • Procedure, recursion
• Finite state automaton
  • Mealy machine
  • Minsky machine
  • Moore machine
  • State diagram
  • State transition system
  • Deterministic finite state machine
  • Nondeterministic finite state machine
  • Generalized nondeterministic finite state machine
  • Regular language
    • Pumping lemma
    • Myhill-Nerode theorem
  • Regular expression
  • Regular grammar
  • Prefix grammar
  • Tree automaton
• Pushdown automaton
  • Context-free grammar
• Büchi automaton
• Chomsky hierarchy
  • Context-sensitive language, context-sensitive grammar
  • Recursively enumerable language
• Register machine
• Stack machine
• Petri net
• Post machine
• Rewriting
  • Markov algorithm
  • Term rewriting
  • String rewriting system
  • L-system
  • Knuth-Bendix completion algorithm
• Star height
  • Star height problem
  • Generalized star height problem
• Cellular automaton
  • Rule 110 cellular automaton
  • Conway's Game of Life
  • Langton's ant
  • Edge of chaos
• Turing machine
  • Deterministic Turing machine
  • Non-deterministic Turing machine
  • Alternating Turing machine
  • Turing-complete
  • Turing tarpit
  • Oracle machine
• Lambda calculus
• Combinatory logic
  • Combinator
    • B,C,K,W System
• Parallel computing
• Flynn's taxonomy
• Quantum computer
  • Universal quantum computer
• Church-Turing thesis
  • Recursive function

Decision problems

• Entscheidungsproblem
• Halting problem
  • Correctness
• Post correspondence problem
• Decidable language
  • Undecidable language
• Word problem for groups
• Wang tile
• Penrose tiling

Definability questions

• Computable number
• Definable number
• Halting probability
• Algorithmic information theory
• Algorithmic probability
• Data compression
• Reductibility

Complexity theory

• Polynomial time
• Subquadratic time
• Exponential time
• Time hierarchy theorem
• Space hierarchy theorem
• Polynomial-time many-one reduction
• Polynomial-time Turing reduction
• Cook's theorem
• Busy beaver
• Speed Prior
• Speedup theorem
• Linear speedup theorem
• Savitch's theorem
• Natural proof
• Advice (complexity)
• Arthur-Merlin protocol
• Function problem

Complexity classes

See the list of complexity classes

• Exponential hierarchy
• Polynomial hierarchy

Named problems

• Clique problem
• Hamiltonian cycle problem
• Hamiltonian path problem
• Integer factorization
• Knapsack problem
• Satisfiability problem
  • 2-satisfiability
  • Boolean satisfiability problem
• Subset sum problem
• 3SUM
• Traveling salesman problem
• Vertex cover problem
• One way function
• Set cover problem
• Independent set problem

Extensions

• Probabilistic algorithm, randomized algorithm
• Las Vegas algorithm
• Non-deterministic Turing machine
• Interactive computation
• Interactive proof system
• Probabilistic Turing Machine
• Approximation algorithm
• Fixed-parameter algorithm
• Simulated annealing
• Ant colony algorithm
• Game semantics
• Computability logic
• Process calculus
  • Pi-calculus
• Hypercomputation

This is the "List of computability and complexity topics" reference article from the English Wikipedia. All text is available under the terms of the GNU Free Documentation License. See also our Disclaimer.