scientific article; zbMATH DE number 1460545

Publication date: 18 June 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Turing machines computability computable analysis type-2 theory of effectivity computable metric spaces naming systems

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Constructive and recursive analysis (03F60) Continuity and related questions (modulus of continuity, semicontinuity, discontinuities, etc.) for real functions in one variable (26A15) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Constructive real analysis (26E40)

Related Items (only showing first 100 items - show all)

Characterizing time computational complexity classes with polynomial differential equations ⋮ Abstract State Machines with Exact Real Arithmetic ⋮ Algebraic properties of the first-order part of a problem ⋮ On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 ⋮ Primitive recursive reverse mathematics ⋮ Semantics of computable physical models ⋮ Numberings, c.e. oracles, and fixed points ⋮ Recursive solution of initial value problems with temporal discretization ⋮ The ksmt calculus is a $\delta $-complete decision procedure for non-linear constraints ⋮ On the complexity of the theory of a computably presented metric structure ⋮ The dependence of computability on numerical notations ⋮ Generalized effective completeness for continuous logic ⋮ THE DISCONTINUITY PROBLEM ⋮ Computable approximations of a chainable continuum with a computable endpoint ⋮ Effective weak and vague convergence of measures on the real line ⋮ Separating notions in effective topology ⋮ On the main scientific achievements of Victor Selivanov ⋮ Notes on overt choice ⋮ How much partiality is needed for a theory of computability? ⋮ The complexity of finding supergraphs ⋮ A domain-theoretic framework for robustness analysis of neural networks ⋮ Computable soft separation axioms ⋮ A continuous characterization of PSPACE using polynomial ordinary differential equations ⋮ Extracting total Amb programs from proofs ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing ⋮ Arithmetical hierarchy of the Besicovitch-stability of noisy tilings ⋮ Synthesizing Computable Functions from Rational Specifications Over Infinite Words ⋮ Unnamed Item ⋮ Primitive recursive ordered fields and some applications ⋮ Quantitative continuity and Computable Analysis in Coq ⋮ Computability of measurable sets via effective metrics ⋮ Weakly computable real numbers ⋮ Algorithmic randomness over general spaces ⋮ Probability, statistics and computation in dynamical systems ⋮ Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization ⋮ Wadge hardness in Scott spaces and its effectivization ⋮ Kolmogorov complexity and the geometry of Brownian motion ⋮ Positive predicate structures for continuous data ⋮ Wadge-like reducibilities on arbitrary quasi-Polish spaces ⋮ Effective metric model theory ⋮ Some hierarchies of QCB₀-spaces ⋮ Computable analysis and Blaschke products ⋮ Experimental computation of real numbers by Newtonian machines ⋮ Computer Science for Continuous Data ⋮ The Church-Turing Thesis over Arbitrary Domains ⋮ Non-computable Julia sets ⋮ The fan theorem and unique existence of maxima ⋮ ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES ⋮ WEIHRAUCH GOES BROUWERIAN ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ Computing on the Banach space C [ 0 , 1 ] ⋮ Point Degree Spectra of Represented Spaces ⋮ Effectivizing Lusin’s Theorem ⋮ Effective Borel measurability and reducibility of functions ⋮ Alan Turing and the Foundations of Computable Analysis ⋮ Unnamed Item ⋮ Towards Using Exact Real Arithmetic for Initial Value Problems ⋮ Partial Randomness and Dimension of Recursively Enumerable Reals ⋮ Points on Computable Curves of Computable Lengths ⋮ Computability and Analysis, a Historical Approach ⋮ The Brouwer Fixed Point Theorem Revisited ⋮ Towards Computational Complexity Theory on Advanced Function Spaces in Analysis ⋮ On the Lattices of Effectively Open Sets ⋮ Base-Complexity Classifications of QCB $$_0$$ 0 -Spaces ⋮ Intuitionistic Provability versus Uniform Provability in $$\mathsf{RCA}$$ ⋮ Randomness and Differentiability of Convex Functions ⋮ Rice’s Theorem in Effectively Enumerable Topological Spaces ⋮ Towards the Effective Descriptive Set Theory ⋮ On Computability of Navier-Stokes’ Equation ⋮ UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES ⋮ On computability and disintegration ⋮ Computations with oracles that measure vanishing quantities ⋮ A comparison of concepts from computable analysis and effective descriptive set theory ⋮ On the computational complexity of the Dirichlet Problem for Poisson's Equation ⋮ Computable elements and functions in effectively enumerable topological spaces ⋮ Effective Riemann mappings of multiply connected domains and Riemann surfaces ⋮ Towards a descriptive theory of cb₀-spaces ⋮ A uniformly computable Implicit Function Theorem ⋮ Programming Experimental Procedures for Newtonian Kinematic Machines ⋮ Internal Density Theorems for Hierarchies of Continuous Functionals ⋮ Seven Kinds of Computable and Constructive Infelicities in Economics ⋮ Dimensions of Points in Self-similar Fractals ⋮ ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM ⋮ Hierarchies of function classes defined by the first-value operator ⋮ Probability and algorithmics: a focus on some recent developments ⋮ Computable symbolic dynamics ⋮ On Turing degrees of points in computable topology ⋮ Sequential real number computation and recursive relations ⋮ Uniformly computable aspects of inner functions: estimation and factorization ⋮ On Σ‐definability without equality over the real numbers ⋮ Singular coverings and non‐uniform notions of closed set computability ⋮ Topological Properties of Concept Spaces ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Computability of the Solutions to Navier-Stokes Equations via Effective Approximation ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ Generalizing Computability Theory to Abstract Algebras ⋮ A SOLUTION TO THE SURPRISE EXAM PARADOX IN CONSTRUCTIVE MATHEMATICS ⋮ Characterization of sets of limit measures of a cellular automaton iterated on a random configuration ⋮ The power of backtracking and the confinement of length

This page was built for publication: