On the Power of Threshold Measurements as Oracles

  • Edwin Beggs
  • José Félix Costa
  • Diogo Poças
  • John V. Tucker
Conference paper

DOI: 10.1007/978-3-642-39074-6_3

Volume 7956 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Beggs E., Costa J.F., Poças D., Tucker J.V. (2013) On the Power of Threshold Measurements as Oracles. In: Mauri G., Dennunzio A., Manzoni L., Porreca A.E. (eds) Unconventional Computation and Natural Computation. UCNC 2013. Lecture Notes in Computer Science, vol 7956. Springer, Berlin, Heidelberg

Abstract

We consider the measurement of physical quantities that are thresholds. We use hybrid computing systems modelled by Turing machines having as an oracle physical equipment that measures thresholds. The Turing machines compute with the help of qualitative information provided by the oracle. The queries are governed by timing protocols and provide the equipment with numerical data with (a) infinite precision, (b) unbounded precision, or (c) finite precision. We classify the computational power in polynomial time of a canonical example of a threshold oracle using non-uniform complexity classes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Edwin Beggs
    • 1
  • José Félix Costa
    • 2
    • 3
  • Diogo Poças
    • 2
    • 3
  • John V. Tucker
    • 1
  1. 1.College of ScienceSwansea UniversitySwanseaUnited Kingdom
  2. 2.Department of Mathematics, Instituto Superior TécnicoUTLLisbonPortugal
  3. 3.Centro de Matemática e Aplicações FundamentaisUniversity of LisbonPortugal