关于低速预言机
On low for speed oracles
摘要:
将图灵机的计算相对于预言机是计算理论中的一个中心概念,无论是在复杂性理论还是在可计算性理论中(!)。受可计算性理论中的低级概念的启发,Allender引入了“低速”预言机的概念。如果相对化到A对计算复杂性基本上没有影响,则oracle A的速度较低,这意味着如果可判定语言可以在访问oracle A的情况下在时间$f(n)$中判定,则可以在没有任何oracle的情况下在时间poly(f(n))中判定。不可计算的A的存在后来被拜耳和斯拉曼证明,他们甚至构建了一个可计算的A,并展示了这些预言的一些性质以及与可计算性理论的有趣联系。在本文中,我们继续这条研究路线,回答了拜耳和斯拉曼留下的问题,并进一步证明了低速预言机的结构是非常丰富的。
英文摘要:
Relativizing computations of Turing machines to an oracle is a central concept in the theory of computation, both in complexity theory and in computability theory(!). Inspired by lowness notions from computability theory, Allender introduced the concept of "low for speed" oracles. An oracle A is low for speed if relativizing to A has essentially no effect on computational complexity, meaning that if a decidable language can be decided in time $f(n)$ with access to oracle A, then it can be decided in time poly(f(n)) without any oracle. The existence of non-computable such A's was later proven by Bayer and Slaman, who even constructed a computably enumerable one, and exhibited a number of properties of these oracles as well as interesting connections with computability theory. In this paper, we pursue this line of research, answering the questions left by Bayer and Slaman and give further evidence that the structure of the class of low for speed oracles is a very rich one.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。