IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
From MaRDI portal
Publication:3152238
DOI10.1112/S0024611502013643zbMath1011.03035MaRDI QIDQ3152238
Publication date: 22 October 2002
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
wave equationTuring machinecomputable analysistype 2 theory of effectivityChurch/Turing Thesiscomputability of wave propagationwave computer
Constructive and recursive analysis (03F60) Wave equation (35L05) Initial value problems for second-order hyperbolic equations (35L15) Applications of computability and recursion theory (03D80)
Related Items
Comparing representations for function spaces in computable analysis, Computability and Dynamical Systems, Towards Computational Complexity Theory on Advanced Function Spaces in Analysis, The impact of models of a physical oracle on computational power, Incomputability in Physics and Biology, On Computability of Navier-Stokes’ Equation, Computing Schrödinger propagators on type-2 Turing machines, Computational unsolvability of domains of attraction of nonlinear systems, Can Newtonian systems, bounded in space, time, mass and energy compute all functions?, Semantics of computable physical models, Computations with oracles that measure vanishing quantities, On the computational complexity of the Dirichlet Problem for Poisson's Equation, Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations, Computability of entropy and information in classical Hamiltonian systems, Computability of the Solutions to Navier-Stokes Equations via Effective Approximation, Computable and Continuous Partial Homomorphisms on Metric Partial Algebras, Computing Uniform Bounds, The Solution Operator of the Korteweg-de Vries Equation is Computable, Complexity of Blowup Problems, Computing Solutions of Symmetric Hyperbolic Systems of PDE's, Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs, Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I), Computability with polynomial differential equations, Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines, Embedding infinitely parallel computation in Newtonian kinematics, Experimental computation of real numbers by Newtonian machines, Computability, noncomputability and undecidability of maximal intervals of IVPs, On the computability of the set of automorphisms of the unit square, Computations via Newtonian and relativistic kinematic systems, Computational bounds on polynomial differential equations, Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics, Computational complexity with experiments as oracles, The Significance of Relativistic Computation for the Philosophy of Mathematics, Computability of Differential Equations, Bit-complexity of solving systems of linear evolutionary partial differential equations
