Experimental computation of real numbers by Newtonian machines
From MaRDI portal
Publication:5438843
DOI10.1098/rspa.2007.1835zbMath1130.68051OpenAlexW2120460460MaRDI QIDQ5438843
Publication date: 8 February 2008
Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1098/rspa.2007.1835
computable real numbersexperimental computationNewtonian machinesnon-computable physical systemsphysical models of computation
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (19)
The physical Church thesis as an explanation of the Galileo thesis ⋮ The impact of models of a physical oracle on computational power ⋮ Physical oracles: the Turing machine and the Wheatstone bridge ⋮ Machines that perform measurements ⋮ On the Complexity of Measurement in Classical Physics ⋮ The Elliptic Integral Machine: A Collision-based Model of Computation ⋮ Computations with oracles that measure vanishing quantities ⋮ Programming Experimental Procedures for Newtonian Kinematic Machines ⋮ Oracles and Advice as Measurements ⋮ THE PHYSICAL CHURCH-TURING THESIS AND THE PRINCIPLES OF QUANTUM THEORY ⋮ Computational complexity with experiments as oracles. II. Upper bounds ⋮ THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY ⋮ Limits to measurement in experiments governed by algorithms ⋮ Some surprising instabilities in idealized dynamical systems ⋮ Computations via Newtonian and relativistic kinematic systems ⋮ Emergence as a computability-theoretic phenomenon ⋮ Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics ⋮ Computational complexity with experiments as oracles ⋮ A Survey on Analog Models of Computation
Cites Work
- Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
- Computations via Newtonian and relativistic kinematic systems
- The wave equation with computable initial data such that its unique solution is not computable
- Undecidability and incompleteness in classical mechanics
- A notion of mechanistic theory
- Recursion theory on the reals and continuous-time computation
- Analog computers and recursive functions over the reals.
- Embedding infinitely parallel computation in Newtonian kinematics
- Church's thesis meets the \(N\)-body problem
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- Classical physics and the Church--Turing Thesis
- Computability and Noncomputability in Classical Analysis
- A computable ordinary differential equation which possesses no computable solution
- Unpredictability and undecidability in dynamical systems
- Coupled map lattices as computational systems
- Abstract versus concrete computation on metric partial algebras
- Mathematical Theory of the Differential Analyzer
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Experimental computation of real numbers by Newtonian machines
