scientific article; zbMATH DE number 3110188

Cited in

(29)

Feasible real random access machines
Index sets in computable analysis
Markov's constructive analysis; a participant's view
On the information carried by programs about the objects they compute
Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
Efficient exact computation of iterated maps
An analog characterization of the Grzegorczyk hierarchy
On the time complexity of partial real functions
Algorithmic randomness and Fourier analysis
A computability challenge: asymptotic bounds for error-correcting codes
Dimensions of Points in Self-similar Fractals
Computable symbolic dynamics
Computability and Noncomputability in Classical Analysis
Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
Theses for computation and recursion on concrete and abstract structures
Computing uniform bounds
How incomputable is the separable Hahn-Banach theorem?
Effective symbolic dynamics
On computable metrization
Computable complex analysis
Computable Geometric Complex Analysis and Complex Dynamics
Algorithmic Fractal Dimensions in Geometric Measure Theory
Three topological reducibilities for discontinuous functions
Intersection points of planar curves can be computed
Notes on computable analysis
Non-computable Julia sets
Curves that must be retraced
Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing
Borel complexity and computability of the Hahn-Banach theorem

This page was built for publication:

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