Modeladvanced
Alternating Turing machine
Also called ATM.
Nondeterministic machine whose states are existential or universal; characterizes PSPACE and the polynomial hierarchy.
Nondeterministic machine whose states are existential or universal; characterizes PSPACE and the polynomial hierarchy.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 12W6M0 Edit this page History Report an error