The wave equation with computable initial data such that its unique solution is not computable
From MaRDI portal
Publication:1154609
DOI10.1016/0001-8708(81)90001-3zbMath0465.35054OpenAlexW2052388820MaRDI QIDQ1154609
Ian Richards, Marian Boykan Pour-El
Publication date: 1981
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0001-8708(81)90001-3
Related Items (45)
The complexity of analog computation ⋮ Undecidability through Fourier series ⋮ Recursivity in Quantum Mechanics ⋮ The impact of models of a physical oracle on computational power ⋮ On Computability of Navier-Stokes’ Equation ⋮ Can Newtonian systems, bounded in space, time, mass and energy compute all functions? ⋮ Undecidability of the Spectral Gap ⋮ Semantics of computable physical models ⋮ Computations with oracles that measure vanishing quantities ⋮ Computability and Noncomputability in Classical Analysis ⋮ Indeterminism in physics and intuitionistic mathematics ⋮ Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing ⋮ Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations ⋮ Physical Computability Theses ⋮ Recursive analysis of singular ordinary differential equations ⋮ Laplace's demon consults an oracle: the computational complexity of prediction ⋮ Noncomputability in models of physical phenomena ⋮ Computability of entropy and information in classical Hamiltonian systems ⋮ Undecidability and incompleteness in classical mechanics ⋮ Computability of the Solutions to Navier-Stokes Equations via Effective Approximation ⋮ Computation, hypercomputation, and physical science ⋮ Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs ⋮ Computability with polynomial differential equations ⋮ Dummett's case for intuitionism ⋮ The case for hypercomputation ⋮ Embedding infinitely parallel computation in Newtonian kinematics ⋮ How much can analog and hybrid systems be proved (super-)Turing ⋮ Experimental computation of real numbers by Newtonian machines ⋮ Computability, noncomputability and undecidability of maximal intervals of IVPs ⋮ The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not ⋮ 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 ⋮ From axiomatics to intrinsic characterization: some open problems in computable analysis ⋮ Computationalism ⋮ Computational complexity with experiments as oracles ⋮ Undecidability principle and the uncertainty principle even for classical systems ⋮ Computational strategies for the Riemann zeta function ⋮ Power series solutions of algebraic differential equations ⋮ Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators ⋮ Differential equations in constructive analysis and in the recursive realizability topos ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- A notion of mechanistic theory
- A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
- Computable functionals
- On computable sequences
- On the definitions of computable real continuous functions
- A computable ordinary differential equation which possesses no computable solution
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
This page was built for publication: The wave equation with computable initial data such that its unique solution is not computable
