Pages that link to "Item:Q1154609"

The following pages link to The wave equation with computable initial data such that its unique solution is not computable (Q1154609):

Displaying 38 items.

• Undecidability through Fourier series (Q278759) (← links)
• Recursive analysis of singular ordinary differential equations (Q638473) (← links)
• Laplace's demon consults an oracle: the computational complexity of prediction (Q639767) (← links)
• Computability of entropy and information in classical Hamiltonian systems (Q653552) (← links)
• Differential equations in constructive analysis and in the recursive realizability topos (Q793725) (← links)
• Can Newtonian systems, bounded in space, time, mass and energy compute all functions? (Q870250) (← links)
• Computation, hypercomputation, and physical science (Q959046) (← links)
• Computations via Newtonian and relativistic kinematic systems (Q1036523) (← links)
• Computational bounds on polynomial differential equations (Q1036531) (← links)
• Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
• Power series solutions of algebraic differential equations (Q1053752) (← links)
• Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators (Q1054723) (← links)
• The complexity of analog computation (Q1077163) (← links)
• Noncomputability in models of physical phenomena (Q1168502) (← links)
• Undecidability and incompleteness in classical mechanics (Q1176394) (← links)
• From axiomatics to intrinsic characterization: some open problems in computable analysis (Q1292411) (← links)
• Computationalism (Q1583773) (← links)
• Computational strategies for the Riemann zeta function (Q1587405) (← links)
• The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not (Q1821332) (← links)
• On the computability of the set of automorphisms of the unit square (Q2072068) (← links)
• Bit-complexity of solving systems of linear evolutionary partial differential equations (Q2117092) (← links)
• Computability with polynomial differential equations (Q2482915) (← links)
• The case for hypercomputation (Q2497872) (← links)
• Embedding infinitely parallel computation in Newtonian kinematics (Q2497873) (← links)
• How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
• Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations (Q2693688) (← links)
• The impact of models of a physical oracle on computational power (Q2919942) (← links)
• On Computability of Navier-Stokes’ Equation (Q3195712) (← links)
• Computability of the Solutions to Navier-Stokes Equations via Effective Approximation (Q3297826) (← links)
• Recursivity in Quantum Mechanics (Q3338244) (← links)
• Dummett's case for intuitionism (Q3342527) (← links)
• Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
• Undecidability of the Spectral Gap (Q5084676) (← links)
• Experimental computation of real numbers by Newtonian machines (Q5438843) (← links)
• Computational complexity with experiments as oracles (Q5505107) (← links)
• Semantics of computable physical models (Q6057623) (← links)
• Indeterminism in physics and intuitionistic mathematics (Q6180146) (← links)
• Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing (Q6182782) (← links)