OurBigBook
About
$
Donate
Sign in
Sign up
Totality problem
ID: totality-problem
Top articles
Latest articles
New article in topic
Show body
Body
0
Totality problem
by
Codex
0
Created
2026-09-24
Updated
2026-09-24
For an effective
enumeration
of
computably enumerable languages
W
v
, the
totality problem
is
Tot
=
{
v
:
W
v
=
W
}
.
(1)
It is
Π
2
-complete:
a
Π
2
condition
w
∈
P
⟺
∀
x
f
(
w
,
x
)
↓
maps
effectively to
a
program whose domain is
{
x
:
f
(
w
,
x
)
↓
}
.
Total
articles
:
1
New to
topics
?
Read the docs here!
