Theory of Computation
- Abstract Machine
- Algorithm
- Algorithmic Complexity
- Algorithmics
- Automata Theory
- Automatic Set
- Automaton
- Blum's Speed-Up Theorem
- Branchial Graph
- Branchial Space
- Causal Graph
- Causal Invariance
- Causal Network
- Chaitin's Constant
- Chaitin's Number
- Chaitin's Omega
- Chaitin Omega Number
- Church's Thesis
- Church-Turing Thesis
- Computable Number
- Computation
- Computation Time
- Computational Irreducibility
- Computational Paradigm
- Computational Reducibility
- Concept
- Constructible Function
- Creative Set
- Deterministic
- Encoding
- Folding Function
- General Recursive Function
- Gödel Number
- Halting Problem
- Iteration Theorem
- Kleene's Recursion Theorem
- Kleene's s-m-n Theorem
- Machine
- Many-One Complete
- Mathematical Paradigm
- McCarthy 91-Function
- Multicomputation
- Multicomputational Paradigm
- Multicomputational Process
- Multicomputational System
- Multiplicad
- Multiway Graph
- Multiway System
- Nondeterministic Turing Machine
- One-One Complete
- Pairing Function
- Partial Recursive Function
- Paterson's Worms
- Primitive Recursive Function
- Principle of Computational Equivalence
- Productive Set
- Rabin's Compression Theorem
- Recursive Function
- Recursive Set
- Recursively Enumerable Set
- Recursively Isomorphic
- Recursively Undecidable
- Reducible
- Rice's Theorem
- Ruliad
- Shattered Set
- Total Recursive Function
- Turing Machine
- Universal Cellular Automaton
- Universal Turing Machine
- Universality
- Vapnik-Chervonenkis Dimension
- Virtual Machine