License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2018.15
URN: urn:nbn:de:0030-drops-85226
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8522/
Go to the corresponding LIPIcs Volume Portal

Bienvenu, Laurent ; Downey, Rodney

On Low for Speed Oracles

pdf-format:
LIPIcs-STACS-2018-15.pdf (0.5 MB)

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.

BibTeX - Entry

@InProceedings{bienvenu_et_al:LIPIcs:2018:8522,
  author =	{Laurent Bienvenu and Rodney Downey},
  title =	{{On Low for Speed Oracles}},
  booktitle =	{35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
  pages =	{15:1--15:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-062-0},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{96},
  editor =	{Rolf Niedermeier and Brigitte Vall{\'e}e},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8522},
  URN =		{urn:nbn:de:0030-drops-85226},
  doi =		{10.4230/LIPIcs.STACS.2018.15},
  annote =	{Keywords: Lowness for speed, Oracle computations, Turing degrees}
}

Keywords: Lowness for speed, Oracle computations, Turing degrees
Collection: 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)
Issue Date: 2018
Date of publication: 27.02.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI