In computability theory the smn 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 "smn" comes from the occurrence of a 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 m + n 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.
The basic form of the theorem applies to functions of two arguments (Nies 2009, p. 6). Given a Gödel numbering 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 and 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:
More generally, for any m, n > 0, there exists a primitive recursive function of m + 1 arguments that behaves as follows: for every Gödel number p of a partial computable function with m + n arguments, and all values of x1,…,xm:
The function s described above can be taken to be .
For all arities and ,
For every Turing Machine of arity , and for all possible values of inputs ,
there exists a Turing Machine of arity , such that
Furthermore, there is a Turing Machine that allows to be calculated from and ; it is denoted .
Furthermore, the result generalizes to any Turing Complete computing model.
Informally, finds the Turing Machine which is the result of hardcoding the values of into .
The following Lisp code implements s11 for Lisp.
(defun s11 (f x) (let ((y (gensym))) (list 'lambda (list y) (list f x y))))
(s11 '(lambda (x y) (+ x y)) 3) evaluates to
(lambda (g42) ((lambda (x y) (+ x y)) 3 g42)).
- Kleene, S. C. (1936). "General recursive functions of natural numbers". Mathematische Annalen. 112 (1): 727–742. doi:10.1007/BF01565439.
- Kleene, S. C. (1938). "On Notations for Ordinal Numbers" (PDF). The Journal of Symbolic Logic. 3: 150–155. (This is the reference that the 1989 edition of Odifreddi's "Classical Recursion Theory" gives on p. 131 for the smn theorem.)
- Nies, A. (2009). Computability and randomness. Oxford Logic Guides. 51. Oxford: Oxford University Press. ISBN 978-0-19-923076-1. Zbl 1169.03034.
- Odifreddi, P. (1999). Classical Recursion Theory. North-Holland. ISBN 0-444-87295-7.
- Rogers, H. (1987) . The Theory of Recursive Functions and Effective Computability. First MIT press paperback edition. ISBN 0-262-68052-1.
- Soare, R. (1987). Recursively enumerable sets and degrees. Perspectives in Mathematical Logic. Springer-Verlag. ISBN 3-540-15299-7.