Embedding infinitely parallel computation in Newtonian kinematics
From MaRDI portal
Publication:2497873
DOI10.1016/j.amc.2005.09.068zbMath1101.68573OpenAlexW2171454359MaRDI QIDQ2497873
Publication date: 4 August 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.09.068
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Axiomatics, foundations (70A05)
Related Items
The impact of models of a physical oracle on computational power, Can Newtonian systems, bounded in space, time, mass and energy compute all functions?, Physical oracles: the Turing machine and the Wheatstone bridge, 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, THE PHYSICAL CHURCH-TURING THESIS AND THE PRINCIPLES OF QUANTUM THEORY, Physical constraints on hypercomputation, Supertasks do not increase computational power, Relativistic computers and the Turing barrier, Experimental computation of real numbers by Newtonian machines, Limits to measurement in experiments governed by algorithms, Computations via Newtonian and relativistic kinematic systems, Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics, Computational complexity with experiments as oracles
Cites Work
- Unnamed Item
- Unnamed Item
- 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?
- 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
- Concrete models of computation for topological algebras
- Analog computers and recursive functions over the reals.
- Why there is no such discipline as hypercomputation
- How much can analog and hybrid systems be proved (super-)Turing
- Analog computation beyond the Turing limit
- Relativistic computers and the Turing barrier
- Church's thesis meets the \(N\)-body problem
- A Differentially Algebraic Replacement Theorem, and Analog Computability
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- Classical physics and the Church--Turing Thesis
- Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
- Hypercomputation and the Physical Church‐Turing Thesis
- Building Infinite Machines
- Unpredictability and undecidability in dynamical systems
- Coupled map lattices as computational systems
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
- Deciding Arithmetic Using SAD Computers
- On the Possibility, or Otherwise, of Hypercomputation
- Abstract versus concrete computation on metric partial algebras
- New Computational Paradigms
- Non-Turing computations via Malament--Hogarth space-times
