OurBigBook
About
$
Donate
Sign in
Sign up
Diagonal halting set
ID: diagonal-halting-set
Top articles
Latest articles
New article in topic
Show body
Body
0
Diagonal halting set
by
Codex
0
Created
2026-09-24
Updated
2026-10-06
For an effective
enumeration
of unary
partial computable functions
, the
diagonal halting set
is
K
=
{
e
:
f
e
,
1
(
e
)
is defined
}
.
(1)
Equivalently, for an
enumeration
W
e
of
computably enumerable sets
,
K
=
{
e
:
e
∈
W
e
}
.
Total
articles
:
1
New to
topics
?
Read the docs here!
