Site Navigation
Categories:
Category:Recursion theory
[+]
[+]
[+]
[+]
[+]
[+]
Theoretical computer science
Recursion theory

Summary Of: Category:Theory of computation

Encyclodia Page On: Category:Theory of computation

These Are Links To Other Documents
theory of computation | computer science | mathematical logic | recursion theory | Category:Recursion theory | [+] | [+] | [+] | [+] | [+] | [+] | learn more | Theory of computation | Computability theory (computer science) | List of undecidable problems | Abstract machine | Abstract state machines | Acceptable programming system | Ackermann function | Anonymous recursion | Applicative computing systems | Big step semantics | Blockhead (computer system) | Bremermann's limit | Busy beaver | Byzantine fault tolerance | Categorical abstract machine | Chain rule for Kolmogorov complexity | Chaitin's constant | Church–Turing thesis | Communicating X-Machine | Computable function | Computable isomorphism | Computable number | Computation history | Computation in the limit | Computational model | Computational semiotics | Counting problem (computability theory) | Cylindric numbering | Cylindrification | Decision problem | Description number | Entscheidungsproblem | Extended finite state machine | First Draft of a Report on the EDVAC | Gödel number | Halting problem | History of the Church-Turing thesis | Hypercomputation | Index set (recursion theory) | Introduction to the Theory of Computation | Kolakoski sequence | Kolmogorov complexity | Limiting recursive | Limits to computation | List of computability and complexity topics | Machine that always halts | Markov algorithm | Model of computation | Mortality (computability theory) | Mutual recursion | Nomogram | Nondeterministic algorithm | Numbering (computability theory) | Object-capability model | Omega language | Optimization problem | Parallel computation thesis | Parallel terraced scan | Post correspondence problem | Powerset construction | Primitive recursive function | Promise problem | Quantum Byzantine agreement | Quantum Turing machine | Range problem | Real computation | Recurrence relation | Recursion | Recursive language | Recursive languages and sets | Recursive set | Recursively enumerable language | Recursively enumerable set | Rice's theorem | Rice-Shapiro theorem | Rogers' equivalence theorem | Roman abacus | SXM (computational model) | Scale factor (computer science) | Search problem | Self-reference | Semi-Thue system | Simply typed lambda calculus | Slide rule | Small step semantics | Smn theorem | Stream X-Machine | Sudan function | Super-recursive algorithm | Tail recursion | Tarski–Kuratowski algorithm | Ten15 | Turing completeness | Turing degree | Turing machine equivalents | Turing tarpit | Turing's proof | Two Generals' Problem | Two-way deterministic finite automaton | Type inhabitation problem | Typed lambda calculus | Unsolved problems in computer science | Utm theorem | Wang tile | X-Machine Testing | X-machine | Μ-recursive function | Categories | Theoretical computer science | Recursion theory |
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Category:Theory of computation".