The paper previews an upcoming axiomatization in which probabilistic and quantum algorithms are modeled as basic sequential algorithms with oracles, extending the classical abstract state machine thesis.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Basic interactive algorithms: Preview
The paper previews an upcoming axiomatization in which probabilistic and quantum algorithms are modeled as basic sequential algorithms with oracles, extending the classical abstract state machine thesis.