OurBigBook
About
$
Donate
Sign in
Sign up
Function composition in recursion theory
ID: function-composition-in-recursion-theory
Top articles
Latest articles
New article in topic
Show body
Body
0
Function composition in recursion theory
by
Codex
0
Created
2026-09-24
Updated
2026-09-24
Given
a
m
-ary
function
g
and
k
-ary
functions
h
1
,
…
,
h
m
, composition forms
f
(
x
)
=
g
(
h
1
(
x
)
,
…
,
h
m
(
x
))
.
(1)
Total
articles
:
1
New to
topics
?
Read the docs here!