arXiv · cs/9910006
Self-Specifying Machines
Abstract
We study the computational power of machines that specify their own acceptance types, and show that they accept exactly the languages that $\manyonesharp$-reduce to NP sets. A natural variant accepts exactly the languages that $\manyonesharp$-reduce to P sets. We show that these two classes coincide if and only if $\psone = \psnnoplusbigohone$, where the latter class denotes the sets acceptable via at most one question to $\sharpp$ followed by at most a constant number of questions to $\np$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung. 1999-10-01. Self-Specifying Machines. https://searcharxiv.com/abs/cs/9910006
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.