Recursive function theory

[318/72%]

Subtopics

Primitive recursive functions[177/69%]
Gödel numbering and pairing functions[138/74%]
Diagonalization (Cantor/Turing argument)[36/67%]
Closure properties of general and partial recursive functions[29/79%]
Recursive and primitive recursive sets and predicates[26/58%]
s-m-n theorem[18/72%]
Alternative bases for recursive function classes[13/54%]
Universal functions (computability)[12/100%]
Unrestricted (type-0) grammars[11/36%]
Busy beaver function[8/88%]
Dovetailing[6/33%]
Equivalence of Turing computability and partial recursiveness[6/100%]
Existence proofs by countability[5/80%]
Graph theorem for partial recursive functions[4/100%]
Kleene normal form theorem[4/100%]