OurBigBook
About
$
Donate
Sign in
Sign up
Function composition in recursion theory
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Foundations of mathematics
Computability theory
Primitive recursive function
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
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)
Ancestors
(6)
Primitive recursive function
Computability theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(10)
Past exam of the mathematics course of the University of Cambridge
/
2002
/
iii
/
Paper 76
/
4
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2012
/
iii
/
Paper 24
/
2
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2015
/
iii
/
Paper 25
/
3
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2016
/
iii
/
Paper 120
/
4
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2016
/
iii
/
Paper 120
/
6
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2017
/
iii
/
Paper 135
/
6
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2020
/
ii
/
Paper 1
/
12F
/
b
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2021
/
iii
/
Paper 120
/
4
/
a
/
Solution
Past exam of the mathematics course of the University of Cambridge
/
2021
/
ii
/
Paper 1
/
12F
/
i
/
Solution
Primitive recursive function in intension
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version