Computation with real numbers and continuous-time dynamical systems
From MaRDI portal
Cites work
- A characterisation of functions computable in polynomial time and space over the reals with discrete ordinary differential equations: simulation of Turing machines with analytic discrete ODEs
- A computable ordinary differential equation which possesses no computable solution
- A continuous characterization of PSPACE using polynomial ordinary differential equations
- A new conceptual framework for analog computation
- A rigorous ODE solver and Smale's 14th problem
- A Survey on Analog Models of Computation
- A tutorial on computable analysis
- Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
- Achilles and the tortoise climbing up the arithmetical hierarchy
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
- Analog computers and recursive functions over the reals.
- Characterizing time computational complexity classes with polynomial differential equations
- Complexity theory for operators in analysis
- Computability of Differential Equations
- Computability of topological entropy: from general systems to transformations on Cantor sets and the interval
- Computability with polynomial differential equations
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- Computable Geometric Complex Analysis and Complex Dynamics
- Computable Measure Theory and Algorithmic Randomness
- Computational complexity of smooth differential equations
- Computing geometric Lorenz attractors with arbitrary precision
- Computing the exact number of periodic orbits for planar flows
- Constructing Turing complete Euler flows in dimension 3
- Deterministic Nonperiodic Flow
- Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
- Exotic attractors. From Liapunov stability to riddled basins
- Handbook of computability and complexity in analysis
- scientific article; zbMATH DE number 1581767 (Why is no real title available?)
- scientific article; zbMATH DE number 4051615 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 2229941 (Why is no real title available?)
- Iteration, inequalities, and differentiability in analog computers
- Lipschitz continuous ordinary differential equations are polynomial-space complete
- Mathematical problems for the next century
- Mathematical Theory of the Differential Analyzer
- Noise vs computational intractability in dynamics
- Non-computable Julia sets
- On computable numbers, with an application to the Entscheidungsproblem.
- On the algorithmic descriptive complexity of attractors in topological dynamics
- On the computational complexity of ordinary differential equations
- Polynomial differential equations compute all real computable functions on computable compact intervals
- Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length: the general purpose analog computer and computable analysis are two efficiently equivalent models of computations
- Programming with ordinary differential equations: some first steps towards a programming language
- Quantifiying the robustness of dynamical systems. Relating time and space to length and precision
- Recursive function theory and numerical analysis
- Solving discontinuous initial value problems with unique solutions is equivalent to computing over the transfinite
- Statistical properties of dynamical systems -- Simulation and abstract computation
- The complexity of computing in continuous time: space complexity is precision
- The differential analyzer. A new machine for solving differential equations.
- The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations
- The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable
- Topological complexity of blowup problems
- Turing Universality of the Incompressible Euler Equations and a Conjecture of Moore
- Universality of Euler flows and flexibility of Reeb embeddings
This page was built for publication: Computation with real numbers and continuous-time dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6897663)
