Computations via Newtonian and relativistic kinematic systems
From MaRDI portal
Publication:1036523
DOI10.1016/j.amc.2009.04.052zbMath1400.70002MaRDI QIDQ1036523
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
computable functions and sets; foundations of computation; foundations of mechanics; Newtonian kinematic systems; non-computable physical systems; relativistic kinematic systems; theory of Gedanken experiments
70-08: Computational methods for problems pertaining to mechanics of particles and systems
70H40: Relativistic dynamics for problems in Hamiltonian and Lagrangian mechanics
Related Items
Experimental computation of real numbers by Newtonian machines, Can Newtonian systems, bounded in space, time, mass and energy compute all functions?, Computations via Newtonian and relativistic kinematic systems, Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics, Embedding infinitely parallel computation in Newtonian kinematics, Definability as hypercomputational effect, Computational power of infinite quantum parallelism
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
