Smn theorem

In computability theory the ' theorem, (also called the translation lemma, parameter theorem, and the parameterization theorem) is a basic result about programming languages (and, more generally, Gödel numberings of the computable functions) (Soare 1987, Rogers 1967). It was first proved by Stephen Cole Kleene (1943). The name ' comes from the occurrence of an ''S'' with subscript ''n'' and superscript ''m'' in the original formulation of the theorem (see below).

In practical terms, the theorem says that for a given programming language and positive integers ''m'' and ''n'', there exists a particular algorithm that accepts as input the source code of a program with free variables, together with ''m'' values. This algorithm generates source code that effectively substitutes the values for the first ''m'' free variables, leaving the rest of the variables free.

Details

The basic form of the theorem applies to functions of two arguments (Nies 2009, p. 6). Given a Gödel numbering $\varphi$ of recursive functions, there is a primitive recursive function ''s'' of two arguments with the following property: for every Gödel number ''p'' of a partial computable function ''f'' with two arguments, the expressions $\varphi_(y)$ and $f(x, y)$ are defined for the same combinations of natural numbers ''x'' and ''y'', and their values are equal for any such combination. In other words, the following extensional equality of functions holds for every ''x'':

: $\varphi_ \simeq \lambda y.\varphi_p(x, y).$

More generally, for any ''m'', , there exists a primitive recursive function $S^m_n$ of arguments that behaves as follows: for every Gödel number ''p'' of a partial computable function with arguments, and all values of ''x''₁, …, ''x''_''m'':

: $\varphi_ \simeq \lambda y_1, \dots, y_n.\varphi_p(x_1, \dots, x_m, y_1, \dots, y_n).$

The function ''s'' described above can be taken to be $S^1_1$.

Formal statement

Given arities and , for every Turing Machine $\text_x$ of arity $m + n$ and for all possible values of inputs $y_1, \dots, y_m$, there exists a Turing machine $\text_k$ of arity , such that

: $\forall z_1, \dots, z_n : \text_x(y_1, \dots, y_m, z_1, \dots, z_n) = \text_k(z_1, \dots, z_n).$

Furthermore, there is a Turing machine that allows to be calculated from and ; it is denoted $k = S_n^m(x, y_1, \dots, y_m)$.

Informally, finds the Turing Machine $\text_k$ that is the result of hardcoding the values of into $\text_x$. The result generalizes to any Turing-complete computing model.

Example

The following Lisp code implements s₁₁ for Lisp.

(defun s11 (f x)
(let ((y (gensym)))
(list 'lambda (list y) (list f x y))))

For example, evaluates to .

See also

* Currying
*Kleene's recursion theorem
* Partial evaluation

References

*
* (This is the reference that the 1989 edition of Odifreddi's "Classical Recursion Theory" gives on p. 131 for the $S^m_n$ theorem.)
*
*
*
*

External links

*{{mathworld, urlname=Kleeness-m-nTheorem, title=Kleene's ''s''-''m''-''n'' Theorem

Computability theory
Theorems in theory of computation
Articles with example Lisp (programming language) code