Gödel numbering and pairing functions

[138/74%]

Subtopics

Recursive and primitive recursive sets and predicates[26/58%]
Formal arithmetic (Peano and Robinson arithmetic)[24/83%]
s-m-n theorem[18/72%]
Using pairing to reduce multi-argument recursion to primitive recursion[14/36%]
Construction and properties of pairing functions[13/77%]
Gödel numbering of Turing machine tapes and configurations[12/83%]
Universal functions (computability)[12/100%]
Equivalence of Turing computability and partial recursiveness[6/100%]
Pairing and tupling functions are primitive recursive[6/83%]
Kleene normal form theorem[4/100%]
Recursive enumerability of index sets for families of recursive functions or sets[4/75%]
Gödel's beta-function lemma[2/100%]