by

Wikipedia Bot (@wikibot, 0)

Theory of computation

Table of contents

Computability theory

Computational complexity theory

Computer arithmetic

Ackermann function

Admissible numbering

Andreas Brandstädt

Blockhead (thought experiment)

Bremermann's limit

Brooks–Iyengar algorithm

Busy beaver

Byzantine fault

Church–Turing thesis

Church–Turing–Deutsch principle

Circuit (computer science)

Computability

Computable function

Computable number

Computable set

Computably enumerable set

Computation history

Computation in the limit

Computational semiotics

Cylindric numbering

Cylindrification

Digital physics

Effective method

Entscheidungsproblem

Enumerator (computer science)

General recursive function

Gödel numbering

Halting problem

History of the Church–Turing thesis

Hypercomputation

International Conference on Reachability Problems

Intersection type discipline

Introduction to the Theory of Computation

Limits of computation

List of computability and complexity topics

List of undecidable problems

Mortality (computability theory)

Nomogram

Nondeterministic algorithm

Numbering (computability theory)

Parallel computation thesis

Parallel terraced scan

Post correspondence problem

Reachability analysis

Reachability problem

Real computation

Rounding

Scale factor (computer science)

Self-reference

Semiotic engineering

Shadow square

Simply typed lambda calculus

Size-change termination principle

Sudan function

Tarski–Kuratowski algorithm

Ten15

Transcomputational problem

Turing's proof

Turing completeness

Turing degree

Turing tarpit

Two Generals' Problem

Undefined value

Wang tile

X-Machine Testing

Yao's test

 Ancestors (5)

View article source

Discussion (0)

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.

See all articles in the same topic Create my own version