An Analogue-Digital Model of Computation: Turing Machines with Physical Oracles

We introduce an abstract analogue-digital model of computation that couples Turing machines to oracles that are physical processes. Since any oracle has the potential to boost the computational power of a Turing machine, the effect on the power of the Turing machine of adding a physical process raises interesting questions. Do physical processes add significantly to the power of Turing machines; can they break the Turing Barrier? Does the power of the Turing machine vary with different physical processes? Specifically, here, we take a physical oracle to be a physical experiment, controlled by the Turing machine, that measures some physical quantity. There are three protocols of communication between the Turing machine and the oracle that simulate the types of error propagation common to analogue-digital devices, namely: infinite precision, unbounded precision, and fixed precision. These three types of precision introduce three variants of the physical oracle model. On fixing one archetypal experiment, we show how to classify the computational power of the three models by establishing the lower and upper bounds. Using new techniques and ideas about timing, we give a complete classification.

[1]  José L. Balcázar,et al.  Structural Complexity II , 2012, EATCS.

[2]  L. BalcSzar.  The structure of logarithmic advice complexity classes , 2003 .

[3]  Edwin J. Beggs,et al.  Limits to measurement in experiments governed by algorithms† , 2009, Mathematical Structures in Computer Science.

[4]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[5]  Edwin J. Beggs,et al.  Computations with oracles that measure vanishing quantities , 2016, Mathematical Structures in Computer Science.

[6]  Hava T. Siegelmann,et al.  Analog computation via neural networks , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[7]  Hava T. Siegelmann,et al.  Neural networks and analog computation - beyond the Turing limit , 1999, Progress in theoretical computer science.

[8]  Patrick Suppes,et al.  Foundations of measurement , 1971 .

[9]  Edwin J. Beggs,et al.  Computational complexity with experiments as oracles , 2008, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[10]  James B. Hartle,et al.  Computability and physical theories , 1986, 1806.09237.

[11]  J. V. Tucker,et al.  Computational Models of Measurement and Hempel’s Axiomatization , 2010 .

[12]  Edwin J. Beggs,et al.  An analogue-Digital Church-Turing Thesis , 2014, Int. J. Found. Comput. Sci..

[13]  Thomas J. Naughton,et al.  An optical model of computation , 2005, Theor. Comput. Sci..

[14]  Jaap Van Brakel,et al.  Foundations of measurement , 1983 .

[15]  Edwin J. Beggs,et al.  Oracles that measure thresholds: the Turing machine and the broken balance , 2013, J. Log. Comput..

[16]  Edwin J. Beggs,et al.  Computational complexity with experiments as oracles. II. Upper bounds , 2009, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[17]  Edwin J. Beggs,et al.  THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY , 2014, The Review of Symbolic Logic.

[18]  Carl G. Hempel,et al.  Fundamentals of Concept Formation in Empirical Science , 1952 .

[19]  J. V. Tucker,et al.  Axiomatizing physical experiments as oracles to algorithms , 2012, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[20]  Olivier Bournez,et al.  On the Computational Power of Dynamical Systems and Hybrid Systems , 1996, Theor. Comput. Sci..

[21]  Edwin J. Beggs,et al.  The impact of models of a physical oracle on computational power , 2012, Math. Struct. Comput. Sci..