Talk:Smn theorem

WikiProject Mathematics (Rated Start-class, Low-priority)
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of Mathematics 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.
Mathematics rating:
 Start Class
 Low Priority
Field:  Foundations, logic, and set theory
WikiProject Computer science
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.

Title

Could the Title not be writen as ${\displaystyle s_{n}^{m}}$ ?

I don't think so - due to technical restrictions sub- and superscripts are not presently possible. --Kizor 12:07, 24 November 2005 (UTC)

merged version by Math MArtin

In computability theory the smn theorem, Kleene's s-m-n Theorem or translation lemma is a basic result about computable functions first given by Stephen Cole Kleene.

smn theorem

Given a Gödel numbering

${\displaystyle \phi :\mathbb {N} \to \mathbf {P} ^{(1)}}$

of the computable functions with one parameter then for every computable function ${\displaystyle f}$ with two parameters ${\displaystyle f\in \mathbf {P} ^{(2)}}$ there exists a total computable function ${\displaystyle \phi (i)\in \mathbf {R} ^{(1)}}$ so that

${\displaystyle f(i,x)=\phi (r(i))(x)\quad i,n\in \mathbb {N} }$