Representation theorems for analytic machines and computability of analytic functions
From MaRDI portal
(Redirected from Publication:693052)
Recommendations
Cites work
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 1022658 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- Analytic machines
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Computability of analytic functions with analytic machines
- Computable Riemann Surfaces
- Logical Approaches to Computational Barriers
- Lower bounds on the continuation of holomorphic functions
- New Computational Paradigms
- Normal families
- 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
- On the pointwise limit of complex analytic functions
- Real analytic machines and degrees: a topological view on algebraic limiting computation
- Real hypercomputation and continuity
Cited in
(7)- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Computability of analytic functions with analytic machines
- Real analytic machines and degrees
- Representations of analytic functions and Weihrauch degrees
- Real analytic machines and degrees: a topological view on algebraic limiting computation
- On the Petras algorithm for verified integration of piecewise analytic functions
- A Differentially Algebraic Replacement Theorem, and Analog Computability
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)