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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Balcázar, J.L., Días, J., Gabarró, J.: Structural Complexity I, 2nd edn. Springer (1988, 1995)
Beggs, E., Costa, J.F., Loff, B., Tucker, J.V.: Computational complexity with experiments as oracles. Proceedings of the Royal Society, Series A (Mathematical, Physical and Engineering Sciences) 464(2098), 2777–2801 (2008)
Beggs, E., Costa, J.F., Loff, B., Tucker, J.V.: On the complexity of measurement in classical physics. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 20–30. Springer, Heidelberg (2008)
Beggs, E., Costa, J.F., Loff, B., Tucker, J.V.: Computational complexity with experiments as oracles II. Upper bounds. Proceedings of the Royal Society, Series A (Mathematical, Physical and Engineering Sciences) 465(2105), 1453–1465 (2009)
Beggs, E., Costa, J.F., Tucker, J.V.: Computational Models of Measurement and Hempel’s Axiomatization. In: Carsetti, A. (ed.) Causality, Meaningful Complexity and Knowledge Construction. Theory and Decision Library A, vol. 46, pp. 155–184. Springer (2010)
Beggs, E., Costa, J.F., Tucker, J.V.: Limits to measurement in experiments governed by algorithms. Mathematical Structures in Computer Science 20(06), 1019–1050 (2010) Special issue on Quantum Algorithms, Venegas-Andraca, S.E. (ed.)
Beggs, E., Costa, J.F., Tucker, J.V.: Axiomatising physical experiments as oracles to algorithms. Philosophical Transactions of the Royal Society, Series A (Mathematical, Physical and Engineering Sciences) 370(12), 3359–3384 (2012)
Beggs, E., Costa, J.F., Tucker, J.V.: The impact of models of a physical oracle on computational power. Mathematical Structures in Computer Science 22(5), 853–879 (2012), Special issue on Computability of the Physical, Calude, C.S., Barry Cooper, S. (eds.)
Hempel, C.G.: Fundamentals of concept formation in empirical science. International Encyclopedia of Unified Science 2(7) (1952)
Jain, S., Osherson, D.N., Royer, J.S., Sharma, A.: Systems That Learn. An Introduction to Learning Theory, 2nd edn. The MIT Press (1999)
Krantz, D.H., Suppes, P., Duncan Luce, R., Tversky, A.: Foundations of Measurement. Dover (2009)
Siegelmann, H.T.: Neural Networks and Analog Computation: Beyond the Turing Limit. Birkhäuser (1999)
von Neumann, J.: Probabilistic logics and the synthesis of reliable organisms from unreliable components. In: Automata Studies, pp. 43–98. Princeton University Press (1956)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-642-39074-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-39074-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39073-9
Online ISBN: 978-3-642-39074-6
eBook Packages: Computer ScienceComputer Science (R0)