scientific article; zbMATH DE number 3110188

Cited in

(29)

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

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)