Kleene's recursion theorem: Difference between revisions

Content deleted Content added
WikiCleanerBot (talk | contribs)
m v2.05b - Bot T20 CW#61 - Fix errors for CW project (Reference before punctuation)
m Spelling/grammar/punctuation/typographical correction
Line 40:
This can be further extended to [[Computable function|computable functions]] with this statement:
 
Let <math>f: \mathbb{N} \rightarrow \mathbb{N}</math> be a total computable function. Then, there exists a program <math>e_0 \in \mathbb{N} </math> such that <math>\phi_{e_0} = \phi_{(f_{(e_0)})}</math>.
 
This essentially means that if we take a program, we apply an [[Effectiveness|effective]] transformation in an extensional way (say, replace instructions such as successor, jump, remove lines), there will always be a program which is not changed by the transformation of the function, even before or after it.