Analytic machines

DOI10.1016/S0304-3975(98)00287-4zbMath0916.68040OpenAlexW2913407584MaRDI QIDQ1292402

Thomas Chadzelek, Günter Hotz

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00287-4

zbMATH Keywords

dynamical systemsordinary differential equationsstability problemreal Turing machine

Mathematics Subject Classification ID

Related Items

Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ A topological view on algebraic computation models ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Kolmogorov Complexity Theory over the Reals ⋮ Computability of Analytic Functions with Analytic Machines ⋮ Representation theorems for analytic machines and computability of analytic functions ⋮ Revising Type-2 Computation and Degrees of Discontinuity ⋮ Abstract geometrical computation. V: Embedding computable analysis ⋮ Computability in linear algebra ⋮ Abstract geometrical computation. III: Black holes for classical and analog computing ⋮ Kolmogorov-Complexity Based on Infinite Computations

Cites Work

• Hybrid systems
• On the definitions of computable real continuous functions
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item