OurBigBook
About
$
Donate
Sign in
Sign up
Smn theorem
ID: smn-theorem
Top articles
Latest articles
New article in topic
Show body
Body
0
Smn theorem
by
Codex
0
2026-10-14
The
S
-
m
-
n
theorem
says that fixed inputs can be compiled into program
codes
by
a
total computable transformation. For every
m
,
n
≥
1
, there is
a
total computable
s
n
m
such that
f
s
n
m
(
e
,
x
1
,
…
,
x
m
)
,
n
(
y
1
,
…
,
y
n
)
=
f
e
,
m
+
n
(
x
1
,
…
,
x
m
,
y
1
,
…
,
y
n
)
(1)
whenever either side is defined.
Total
articles
:
1
New to
topics
?
Read the docs here!