scientific article; zbMATH DE number 3110188

Cited in

(29)

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

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)