Abstract
If we measure the position of a point particle, then we will come about with an interval [a n , b n ] into which the point falls. We make use of a Gedankenexperiment to find better and better values of a n and b n , by reducing their relative distance, in a succession of intervals [a 1, b 1] ⊃ [a 2, b 2] ⊃ ... ⊃ [a n , b n ] that contain the point. We then use such a point as an oracle to perform relative computation in polynomial time, by considering the succession of approximations to the point as suitable answers to the queries in an oracle Turing machine. We prove that, no matter the precision achieved in such a Gedankenexperiment, within the limits studied, the Turing Machine, equipped with such an oracle, will be able to compute above the classical Turing limit for the polynomial time resource, either generating the class P/poly either generating the class BPP//log*, if we allow for an arbitrary precision in measurement or just a limited precision, respectively. We think that this result is astonishingly interesting for Classical Physics and its connection to the Theory of Computation, namely for the implications on the nature of space and the perception of space in Classical Physics. (Some proofs are provided, to give the flavor of the subject. Missing proofs can be found in a detailed long report at the address http://fgc.math.ist.utl.pt/papers/sm.pdf .)
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. Springer, Heidelberg (1988)
Balcázar, J.L., Hermo, M.: The structure of logarithmic advice complexity classes. Theoretical Computer Science 207(1), 217–244 (1998)
Beggs, E., Tucker, J.: Embedding infinitely parallel computation in newtonian kinematics. Applied Mathematics and Computation 178(1), 25–43 (2006)
Beggs, E., Tucker, J.: Can Newtonian systems, bounded in space, time, mass and energy compute all functions? Theoretical Computer Science 371(1), 4–19 (2007)
Beggs, E., Tucker, J.: Experimental computation of real numbers by Newtonian machines. Proceedings of the Royal Society 463(2082), 1541–1561 (2007)
Siegelmann, H.: Neural Networks and Analog Computation: Beyond the Turing Limit. Birkhäuser (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beggs, E., Costa, J.F., Loff, B., Tucker, J. (2008). On the Complexity of Measurement in Classical Physics. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2008. Lecture Notes in Computer Science, vol 4978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79228-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-79228-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79227-7
Online ISBN: 978-3-540-79228-4
eBook Packages: Computer ScienceComputer Science (R0)