Pages that link to "Item:Q3859258"

The following pages link to A computable ordinary differential equation which possesses no computable solution (Q3859258):

Displaying 41 items.

• 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)
• Computations via Newtonian and relativistic kinematic systems (Q1036523) (← links)
• Computational bounds on polynomial differential equations (Q1036531) (← 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)
• Approximation to measurable functions and its relation to probabilistic computation (Q1088659) (← links)
• The wave equation with computable initial data such that its unique solution is not computable (Q1154609) (← links)
• Noncomputability in models of physical phenomena (Q1168502) (← links)
• On the computational complexity of integral equations (Q1207544) (← links)
• On the hierarchy and extension of monotonically computable real numbers. (Q1426053) (← links)
• The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not (Q1821332) (← links)
• An example of noncomputability of exponents of a system of ordinary differential equations (Q1980446) (← links)
• On the computability of the set of automorphisms of the unit square (Q2072068) (← links)
• Programming with ordinary differential equations: some first steps towards a programming language (Q2104250) (← links)
• Computability aspects for 1st-order partial differential equations via characteristics (Q2342677) (← links)
• The case for hypercomputation (Q2497872) (← links)
• How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
• Algorithmic foundations of computable general equilibrium theory (Q2506353) (← links)
• The promise of analog computation (Q2930715) (← links)
• On Effective Convergence of Numerical Solutions for Differential Equations (Q2943897) (← links)
• Computability and Analysis, a Historical Approach (Q3188239) (← links)
• Some Research Problems about Algebraic Differential Equations (Q3314169) (← links)
• Dummett's case for intuitionism (Q3342527) (← links)
• A Domain-Theoretic Account of Picard's Theorem (Q3430832) (← links)
• Computability, noncomputability and undecidability of maximal intervals of IVPs (Q3629381) (← links)
• Computability and Noncomputability in Classical Analysis (Q3657990) (← links)
• Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations? (Q3708798) (← links)
• The knaster-tarski fixed-point theorem is not uniformly constructive (Q3800032) (← links)
• Extensions of Hilbert's tenth problem (Q4302340) (← links)
• Undecidable event detection problems for ODEs of dimension one and two (Q4348239) (← links)
• Computations with oracles that measure vanishing quantities (Q4593234) (← links)
• Decision problems for differential equations (Q4732470) (← links)
• Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach (Q4918008) (← links)
• Complexity of Blowup Problems (Q4918017) (← links)
• Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
• Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I) (Q4921435) (← links)
• The Significance of Relativistic Computation for the Philosophy of Mathematics (Q5015969) (← links)
• Computability of Differential Equations (Q5024569) (← links)
• Experimental computation of real numbers by Newtonian machines (Q5438843) (← links)