Psi-Turing Machines equip TMs with bounded introspection and explicit budgets to prove oracle separations like P^Ψ ≠ NP^Ψ and strict depth hierarchies via new lower-bound techniques.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
Psi-Turing Machines equip TMs with bounded introspection and explicit budgets to prove oracle separations like P^Ψ ≠ NP^Ψ and strict depth hierarchies via new lower-bound techniques.