Skip to main content
SpringerLink
Log in

A Good Oracle Is Hard to Beat

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

A well-known result of Sacks [24] states that if A is nonrecursive, then the set {B : A ≤ T B} has measure zero. Thus, from a measure-theoretic perspective, a ``good'' (i.e., nonrecursive) oracle is hard to beat in the partial order of Turing degrees. We show that analogous results hold for the standard notions of inductive inference, as well as for the notions of approximate inference.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Florida, Gainesville, FL 32611, USA. cenzer@math.ufl.edu., , , , , , US

    D. A. Cenzer

  2. Metawave Communications, Redmond, WA 98052, USA. bmoser@metawave.com., , , , , , US

    W. R. Moser

Authors
  1. D. A. Cenzer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. R. Moser
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received January 25, 1997; revised March 10, 1997, June 3, 1997, and June 15, 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cenzer, D., Moser, W. A Good Oracle Is Hard to Beat. Algorithmica 22, 18–34 (1998). https://doi.org/10.1007/PL00013829

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00013829

Search

Navigation