Analytic machines

DOI10.1016/S0304-3975(98)00287-4MaRDI QIDQ1292402zbMATH OpenOpenAlexFDO

Authors 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

Recommendations

• Computability of analytic functions with analytic machines
• Representation theorems for analytic machines and computability of analytic functions
• Real analytic machines and degrees: a topological view on algebraic limiting computation
• Real analytic machines and degrees
• Machines, Computations, and Universality

Cites work

• scientific article; zbMATH DE number 3160317 (Why is no real title available?)
• scientific article; zbMATH DE number 3987247 (Why is no real title available?)
• scientific article; zbMATH DE number 49432 (Why is no real title available?)
• scientific article; zbMATH DE number 2013199 (Why is no real title available?)
• scientific article; zbMATH DE number 2210384 (Why is no real title available?)
• Hybrid systems
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the definitions of computable real continuous functions

Cited in

(14)

• scientific article; zbMATH DE number 1859211 (Why is no real title available?)
• Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
• Abstract geometrical computation. III: Black holes for classical and analog computing
• Computability of analytic functions with analytic machines
• Computability in linear algebra
• Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
• Representation theorems for analytic machines and computability of analytic functions
• Real analytic machines and degrees
• Abstract geometrical computation. V: Embedding computable analysis
• Kolmogorov-Complexity Based on Infinite Computations
• Revising type-2 computation and degrees of discontinuity
• Real analytic machines and degrees: a topological view on algebraic limiting computation
• Kolmogorov Complexity Theory over the Reals
• A topological view on algebraic computation models

This page was built for publication: Analytic machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292402)