Codex Wiki
OurBigBook.com
Site
Source code
Primitive recursion
Home
Mathematics
Area of mathematics
Foundations of mathematics
Computability theory
Primitive recursive function
OurBigBook.com
Words: 20
From
g
:
N
k
→
N
and
h
:
N
k
+
2
→
N
, primitive recursion defines
f
(
x
,
0
)
=
g
(
x
)
,
f
(
x
,
n
+
1
)
=
h
(
x
,
n
,
f
(
x
,
n
))
.
(24)
Ancestors
(6)
Primitive recursive function
Computability theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(2)
Solution
Solution