# On the Complexity of Measurement in Classical Physics

## 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 .)

## Keywords

Polynomial Time Turing Machine Classical Physic Vertex Position Bernoulli Trial## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Balcázar, J.L., Días, J., Gabarró, J.: Structural Complexity I. Springer, Heidelberg (1988)zbMATHGoogle Scholar
- 2.Balcázar, J.L., Hermo, M.: The structure of logarithmic advice complexity classes. Theoretical Computer Science 207(1), 217–244 (1998)CrossRefMathSciNetzbMATHGoogle Scholar
- 3.Beggs, E., Tucker, J.: Embedding infinitely parallel computation in newtonian kinematics. Applied Mathematics and Computation 178(1), 25–43 (2006)CrossRefMathSciNetzbMATHGoogle Scholar
- 4.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)CrossRefMathSciNetzbMATHGoogle Scholar
- 5.Beggs, E., Tucker, J.: Experimental computation of real numbers by Newtonian machines. Proceedings of the Royal Society 463(2082), 1541–1561 (2007)CrossRefMathSciNetzbMATHGoogle Scholar
- 6.Siegelmann, H.: Neural Networks and Analog Computation: Beyond the Turing Limit. Birkhäuser (1999)Google Scholar