Representation theorems for analytic machines and computability of analytic functions

DOI10.1007/S00224-011-9374-ZzbMath1309.03018OpenAlexW2037059915MaRDI QIDQ693052

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

zbMATH Keywords

analytic functionsanalytic machinescomputability of analytic functionscomputable complex functionsreal computability

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analytic machines
• Normal families
• Real hypercomputation and continuity
• Real Analytic Machines and Degrees
• On the definitions of computable real continuous functions
• On the Pointwise Limit of Complex Analytic Functions
• Computability of Analytic Functions with Analytic Machines
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Lower Bounds on the Continuation of Holomorphic Functions
• Computable Riemann Surfaces
• New Computational Paradigms
• Logical Approaches to Computational Barriers

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