WikiProject Computer science (Rated Stub-class)
This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Stub  This article has been rated as Stub-Class on the project's quality scale.
WikiProject Computing (Rated Stub-class, Low-importance)
This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Stub  This article has been rated as Stub-Class on the project's quality scale.
Low  This article has been rated as Low-importance on the project's importance scale.

## Definition

The definition currently states

This function is universal in the sense that it is partial computable, and for any partial computable function f there is an e such that, for all x, f(e) = Ψ(e,x), where the equality means that either both sides are undefined or both are defined and are equal.

Shouldn't that be f(x) instead of f(e)? It would seem to make much more sense to me. Jonas Wagner (talk) 12:19, 12 December 2012 (UTC)

Yes, you are perfectly right. Thanks for noticing this mistake. — Carl (CBM · talk) 14:46, 12 December 2012 (UTC)

## Notation

The page about Kleene's recursion theorem talks about ${\displaystyle \phi }$ instead of ${\displaystyle \psi }$, and that's also the notation of all my textbooks. Was this a mistake, or are there differnet standard notations?--Blaisorblade (talk) 03:56, 26 October 2013 (UTC)