Kleene's recursion theorem: Difference between revisions

Content deleted Content added
ref to 'Further reading' | {{reflist|refs}} | from parenthetical referencing (deprecated) to short footnote | -{{Use parenthetical referencing}} | +{{Use shortened footnotes}}
Notation: rm confusing
Line 6:
 
== Notation ==
The statement of the theorems refers to an [[admissible numbering]] <math>\varphi</math> of the [[partial recursive function]]s, such that the function corresponding to index <math>e</math> is <math>\varphi_e</math>. In programming terms, <math>e</math> represents a program and <math>\varphi_e</math> represents the function computed by this program.
 
If <math>F</math> and <math>G</math> are [[partial function]]s on the natural numbers, the notation <math>F \simeq G</math> indicates that, for each ''n'', either <math>F(n)</math> and <math>G(n)</math> are both defined and are equal, or else <math>F(n)</math> and <math>G(n)</math> are both undefined.