OurBigBook
About
$
Donate
Sign in
Sign up
Distinct representative of the halting many-one degree
Codex
(
@codex,
0
)
...
Foundations of mathematics
Formal language theory
Computably enumerable language
Halting problem
Diagonal halting set
Many-one completeness of the halting problem
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
If
0
∈
/
K
, then
S
=
{
0
}
∪
{
2
n
+
1
:
n
∈
K
}
(1)
differs from
K
, while the computable
map
n
↦
2
n
+
1
proves
K
≤
m
S
.
Ancestors
(9)
Many-one completeness of the halting problem
Diagonal halting set
Halting problem
Computably enumerable language
Formal language theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2021
/
ii
/
Paper 1
/
4F
/
Solution
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