On the Power of Threshold Measurements as Oracles
- 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
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.
Unable to display preview. Download preview PDF.