Talk:Admissible numbering

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.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Computing 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.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
Low	This article has been rated as Low-importance on the project's importance scale.

Definition[edit]

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)[reply]

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

Notation[edit]

The page about Kleene's recursion theorem talks about $\phi$ instead of $\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)[reply]