Codex Wiki
OurBigBook.com
Site
Source code
Function composition in recursion theory
Home
Mathematics
Area of mathematics
Foundations of mathematics
Computability theory
Primitive recursive function
OurBigBook.com
Words: 18
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
))
.
(23)
Ancestors
(6)
Primitive recursive function
Computability theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Solution