scientific article; zbMATH DE number 3110188
From MaRDI portal
Publication:5848892
zbMath0065.00201MaRDI QIDQ5848892
Publication date: 1955
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An analog characterization of the Grzegorczyk hierarchy, A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes, Three topological reducibilities for discontinuous functions, Intersection points of planar curves can be computed, On the information carried by programs about the objects they compute, Computability and Noncomputability in Classical Analysis, Dimensions of Points in Self-similar Fractals, Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing, Computable symbolic dynamics, Borel complexity and computability of the Hahn-Banach theorem, On the time complexity of partial real functions, Theses for Computation and Recursion on Concrete and Abstract Structures, Notes on computable analysis, Computing Uniform Bounds, Algorithmic randomness and Fourier analysis, How Incomputable is the Separable Hahn-Banach Theorem?, Effective Symbolic Dynamics, On Computable Metrization, Computable total functions on metric algebras, universal algebraic specifications and dynamical systems, Curves that must be retraced, Efficient exact computation of iterated maps, Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers), Non-computable Julia sets, Feasible real random access machines, Index sets in computable analysis, Markov's constructive analysis; a participant's view, Computable Complex Analysis, Computable Geometric Complex Analysis and Complex Dynamics, Algorithmic Fractal Dimensions in Geometric Measure Theory
