Skip to main content
×
Home
    • Aa
    • Aa

Limits to measurement in experiments governed by algorithms

  • EDWIN J. BEGGS (a1), JOSÉ FÉLIX COSTA (a2) and JOHN V. TUCKER (a1)
Abstract

We pose the following question: If a physical experiment were to be completely controlled by an algorithm, what effect would the algorithm have on the physical measurements made possible by the experiment?

In a programme to study the nature of computation possible by physical systems, and by algorithms coupled with physical systems, we have begun to analyse: (i)

the algorithmic nature of experimental procedures; and

(ii)

the idea of using a physical experiment as an oracle to Turing Machines.

To answer the question, we will extend our theory of experimental oracles so that we can use Turing machines to model the experimental procedures that govern the conduct of physical experiments. First, we specify an experiment that measures mass via collisions in Newtonian dynamics and examine its properties in preparation for its use as an oracle. We begin the classification of the computational power of polynomial time Turing machines with this experimental oracle using non-uniform complexity classes. Second, we show that modelling an experimenter and experimental procedure algorithmically imposes a limit on what can be measured using equipment. Indeed, the theorems suggest a new form of uncertainty principle for our knowledge of physical quantities measured in simple physical experiments. We argue that the results established here are representative of a huge class of experiments.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

J. L. Balcázar and M. Hermo (1998) The structure of logarithmic advice complexity classes. Theoretical Computer Science 207 (1) 217244.

J. L. Balcázar , J. Días and J. Gabarró (1988) Structural Complexity I, Springer-Verlag (2nd Edition1995).

J. L. Balcázar , J. Días and J. Gabarró (1990) Structural Complexity II, Springer-Verlag.

E. Beggs and J. V. Tucker (2006) Embedding infinitely parallel computation in Newtonian kinematics. Applied Mathematics and Computation 178 (1) 2543.

E. Beggs and J. V. Tucker (2007a) Can Newtonian systems, bounded in space, time, mass and energy compute all functions? Theoretical Computer Science 371 (1) 419.

E. Beggs and J. V. Tucker (2007b) Experimental computation of real numbers by Newtonian machines. Proceedings of the Royal Society, Series A (Mathematical, Physical and Engineering Sciences) 463 (2082) 15411561.

E. Beggs and J. V. Tucker (2008) Programming experimental procedures for Newtonian kinematic machines. In: A. Beckmann , C. Dimitracopoulos and B. Löwe (eds.) Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms. Springer-Verlag Lecture Notes in Computer Science 5028 5266.

E. Beggs , J. F. Costa , B. Loff and J. V. Tucker (2008a) On the Complexity of Measurement in Classical Physics. Theory and Applications of Models of Computation (TAMC 2008), Xi'an, China. Springer-Verlag Lecture Notes in Computer Science 4978 2030.

E. Beggs , J. F. Costa , B. Loff and J. V. Tucker (2008b) Computational complexity with experiments as oracles. Proceedings of the Royal Society, Series A (Mathematical, Physical and Engineering Sciences) 464 (2098) 27772801.

E. Beggs , J. F. Costa , B. Loff and J. V. Tucker (2008c) Oracles and Advice as Measurements. In: C. S. Calude , J. F. Costa , R. Freund , M. Oswald and G. Rozenberg (eds.) Proceedings UC 2008 – 7th International Conference on Unconventional Computation. Springer-Verlag Lecture Notes in Computer Science 5204 3350.

E. Beggs , J. F. Costa , B. Loff and J. V. Tucker (2009a) Computational complexity with experiments as oracles II. Upper bounds. Proceedings of the Royal Society, Series A (Mathematical, Physical and Engineering Sciences) 465 (2105) 14531465.

E. Beggs , J. F. Costa and J. V. Tucker (2010) Physical oracles: The Turing machine and the Wheatstone bridge. In: D. Aerts , S. Smets and J. P. Van Bendegem (eds.) The contributions of Logic to the Foundations of Physics. Studia Logica 95 217292.

O. Bournez and M. Cosnard (1996) On the computational power of dynamical systems and hybrid systems. Theoretical Computer Science 168 (2) 417459.

T. Radó (1962) On non-computable functions. Bell System Tech. J. 41 (3) 877884.

H. Siegelmann (1999) Neural Networks and Analog Computation: Beyond the Turing Limit, Birkhäuser.

M. Ziegler (2009) Physically-relativized Church–Turing Hypotheses: Physical foundations of computing and complexity theory of computational physics. Applied Mathematics and Computation 215 (4) 14311447.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 9 *
Loading metrics...

Abstract views

Total abstract views: 90 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 25th September 2017. This data will be updated every 24 hours.