Representation theorems for analytic machines and computability of analytic functions

DOI10.1007/S00224-011-9374-ZzbMATH Open1309.03018OpenAlexW2037059915MaRDI QIDQ693052FDOQ693052

Authors: Tobias Gärtner, Günter Hotz 

Publication date: 7 December 2012

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-011-9374-z

Recommendations

• Computability of analytic functions with analytic machines
• Real analytic machines and degrees: a topological view on algebraic limiting computation
• Analytic machines
• Real analytic machines and degrees
• Representations of analytic functions and Weihrauch degrees

zbMATH Keywords

analytic functionsanalytic machinescomputability of analytic functionscomputable complex functionsreal computability

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Constructive and recursive analysis (03F60)

Cites Work

• Title not available (Why is that?)
• Normal families
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the definitions of computable real continuous functions
• Real hypercomputation and continuity
• Analytic machines
• New Computational Paradigms
• On the pointwise limit of complex analytic functions
• Computability of analytic functions with analytic machines
• Lower Bounds on the Continuation of Holomorphic Functions
• Real analytic machines and degrees: a topological view on algebraic limiting computation
• Computable Riemann Surfaces
• Logical Approaches to Computational Barriers

Cited In (5)

• Real analytic machines and degrees: a topological view on algebraic limiting computation
• A Differentially Algebraic Replacement Theorem, and Analog Computability
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• On the Petras algorithm for verified integration of piecewise analytic functions
• Computability of analytic functions with analytic machines

This page was built for publication: Representation theorems for analytic machines and computability of analytic functions

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