S-m-n theorem

The S-m-n theorem says that fixed inputs can be compiled into program codes by a total computable transformation. For every $m,n\ge 1$, there is a total computable $s_n^m$ such thatwhenever either side is defined.