Algorithmic efficiency

Algorithmic information theory

Automata theory

Best, worst and average case

Binary number

Bit

BQP

Busy beaver

Cellular automation

Chaitin's constant

Church-Turing thesis

Complete(complexity)

Complexity class

Computability theory

Computable function

Computational complexity theory

Decision problem

Deterministic algorithm

DSPACE

Entropy

Finite-state machine

Function problem

Halting problem

Hexadecimal

Hypercomputation

Information

Information theory

Kolmogorov complexity

Minimum description length

Minimum message length

Mutual information

Non-deterministic algorithm

Non-deterministic Turing machine

NP(complexity)

Oracle machine

P(complexity)

P versus NP problem

PCP theorem

Polynomial hierarchy

Post's theorem

Probabilistic Turing machine

Quantum algorithm

Quantum computing

Quantum Turing machine

Qubit

Recursive set

Recursively enumerable set

Reduction(complexity)

Rice's Theorem

Space hierarchy theorem

Theory of computation

Time complexity

Time hierarchy theorem

Turing degree

Turing machine

Turing reduction

Undecidable problem

Universal Turing machine