Skip to Main content Skip to Navigation
Conference papers

On Low for Speed Oracles

Laurent Bienvenu 1 Rodney Downey 2
1 ESCAPE - Systèmes complexes, automates et pavages
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : 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.
Complete list of metadata
Contributor : Isabelle Gouat <>
Submitted on : Monday, January 18, 2021 - 11:11:36 AM
Last modification on : Friday, May 28, 2021 - 11:12:06 AM
Long-term archiving on: : Monday, April 19, 2021 - 6:41:11 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License




Laurent Bienvenu, Rodney Downey. On Low for Speed Oracles. 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Feb 2018, Caen, France. pp.15:1-15:13, ⟨10.4230/LIPIcs.STACS.2018.15⟩. ⟨lirmm-03113211⟩



Record views


Files downloads