Metastability-containing Turing machines have non-computable closures in general, with EXPTIME-completeness for single uncertain bits in EXPTIME problems, coNP-completeness for arbitrary uncertain inputs in P, and a hardware UTM for bounded-time machines with exponential time overhead.
and Mazloom, Bita and Mysore, Shashidhar and Chong, Frederic T
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Metastability-Containing Turing Machines
Metastability-containing Turing machines have non-computable closures in general, with EXPTIME-completeness for single uncertain bits in EXPTIME problems, coNP-completeness for arbitrary uncertain inputs in P, and a hardware UTM for bounded-time machines with exponential time overhead.