Programming Experimental Procedures for Newtonian Kinematic Machines

By experimental computationwe mean the idea of computing a function by experimenting with some physical equipment. To analyse the functions computable by experiment, we are developing a methodology that chooses a precise specification of a physical theory Tand derives precise descriptions of the procedures and equipment the theory allows. As a case study, we choose a fragment Tof Newtonian kinematics and describe a language EP(T), and some of its extensions, for expressing experimental proceduresallowed by T. The languages for experimental procedures are similar to imperative programming languages that express algorithmic procedures. We show that EP(T) can define all functions on the rational numbers that are definable by algorithms.

[1]  Edwin J. Beggs,et al.  Embedding infinitely parallel computation in Newtonian kinematics , 2006, Appl. Math. Comput..

[2]  J. V. Tucker,et al.  Computations via experiments with kinematic systems 1 , 2004 .

[3]  T. Toffoli,et al.  Conservative logic , 2002, Collision-Based Computing.

[4]  Christof Teuscher,et al.  From Utopian to Genuine Unconventional Computers , 2006 .

[5]  G. Kreisel.  A Notion of Mechanistic Theory , 1974 .

[6]  J. V. Tucker,et al.  Abstract versus concrete computation on metric partial algebras , 2001, TOCL.

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

[8]  Edward R. Griffor.  Handbook of Computability Theory , 1999, Handbook of Computability Theory.

[9]  Grigore Rosu,et al.  Rule-Based Analysis of Dimensional Safety , 2003, RTA.

[10]  P. Odifreddi.  Classical recursion theory , 1989 .

[11]  Marian Boykan Pour-El,et al.  Computability in analysis and physics , 1989, Perspectives in Mathematical Logic.

[12]  R. O. Gandy,et al.  COMPUTABILITY IN ANALYSIS AND PHYSICS (Perspectives in Mathematical Logic) , 1991 .

[13]  J. V. Tucker,et al.  Computable functions and semicomputable sets on many-sorted algebras , 2001, Logic in Computer Science.

[14]  Andrew Chi-Chih Yao,et al.  Classical physics and the Church--Turing Thesis , 2003, JACM.

[15]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[16]  J. V. Tucker,et al.  Experimental computation of real numbers by Newtonian machines , 2007, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

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

[18]  J. V. Tucker,et al.  Effective algebras , 1995, Logic in Computer Science.

[19]  J. V. Tucker,et al.  Computable and continuous partial homomorphisms on metric partial algebras , 2003, Bull. Symb. Log..

[20]  Viggo Stoltenberg-Hansen,et al.  Computable Rings and Fields , 1999, Handbook of Computability Theory.

[21]  Edwin J. Beggs,et al.  Can Newtonian systems, bounded in space, time, mass and energy compute all functions? , 2007, Theor. Comput. Sci..

[22]  Viggo Stoltenberg-Hansen,et al.  Concrete Models of Computation for Topological Algebras , 1999, Theor. Comput. Sci..