Computations via Newtonian and relativistic kinematic systems

DOI10.1016/j.amc.2009.04.052zbMath1400.70002OpenAlexW1994902659MaRDI QIDQ1036523

J. V. Tucker, Edwin J. Beggs

Publication date: 13 November 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.04.052

zbMATH Keywords

computable functions and setsfoundations of computationfoundations of mechanicsNewtonian kinematic systemsnon-computable physical systemsrelativistic kinematic systemstheory of Gedanken experiments

Mathematics Subject Classification ID

Computational methods for problems pertaining to mechanics of particles and systems (70-08) Relativistic dynamics for problems in Hamiltonian and Lagrangian mechanics (70H40)

Related Items

Can Newtonian systems, bounded in space, time, mass and energy compute all functions? ⋮ Embedding infinitely parallel computation in Newtonian kinematics ⋮ Definability as hypercomputational effect ⋮ Computational power of infinite quantum parallelism ⋮ Experimental computation of real numbers by Newtonian machines ⋮ Computable analysis with applications to dynamic systems ⋮ Computations via Newtonian and relativistic kinematic systems ⋮ Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
• Computability of analog networks
• Computations via Newtonian and relativistic kinematic systems
• Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
• The wave equation with computable initial data such that its unique solution is not computable
• Newtonian supertasks: A critical analysis
• Handbook of computability theory
• Classical recursion theory. Vol. II
• Recursion theory on the reals and continuous-time computation
• Analog computers and recursive functions over the reals.
• Embedding infinitely parallel computation in Newtonian kinematics
• IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
• On the Complexity of Measurement in Classical Physics
• Programming Experimental Procedures for Newtonian Kinematic Machines
• Oracles and Advice as Measurements
• Computational complexity with experiments as oracles. II. Upper bounds
• Computability and Noncomputability in Classical Analysis
• A computable ordinary differential equation which possesses no computable solution
• Unpredictability and undecidability in dynamical systems
• Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
• Abstract versus concrete computation on metric partial algebras
• Experimental computation of real numbers by Newtonian machines
• Computational complexity with experiments as oracles