scientific article

Publication date: 1987

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

productivity Church's thesis computational complexity recursive sets semantics theory of representations numberings recursively enumerable sets recursion theorem partial recursive functions unsolvable problems reducibilities Kleene hierarchy recursion analysis type 2 theory of constructivity and computability

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65) Computability and recursion theory (03Dxx)

Related Items (85)

Effective Borel measurability and reducibility of functions ⋮ Computability with low-dimensional dynamical systems ⋮ Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations ⋮ On Kurtz randomness ⋮ Fast online multiplication of real numbers ⋮ Small universal register machines ⋮ Recursive characterization of computable real-valued functions and relations ⋮ PCF extended with real numbers ⋮ Compactness in constructive analysis revisited ⋮ Representations of the real numbers and of the open subsets of the set of real numbers ⋮ Randomness and universal machines ⋮ A notion of information related to computation ⋮ A topological view on algebraic computation models ⋮ Numberings, c.e. oracles, and fixed points ⋮ Recursive Polish spaces ⋮ A comparison of concepts from computable analysis and effective descriptive set theory ⋮ THE DISCONTINUITY PROBLEM ⋮ Random elements in effective topological spaces with measure. ⋮ How much partiality is needed for a theory of computability? ⋮ Computational complexity of iterated maps on the interval ⋮ An abstract data type for real numbers ⋮ Recursive quasi-metric spaces. ⋮ Completion of choice ⋮ On the time complexity of partial real functions ⋮ On the complexity of online computations of real functions ⋮ A learning-theoretic characterization of classes of recursive functions ⋮ A compositional axiomatization of statecharts ⋮ On the algebraic structure of Weihrauch degrees ⋮ From imperative to rule-based graph programs ⋮ Computable and Continuous Partial Homomorphisms on Metric Partial Algebras ⋮ A Comparison of Certain Representations of Regularly Closed Sets ⋮ Computability of Partial Delaunay Triangulation and Voronoi Diagram [Extended Abstract] ⋮ A Natural Weak Limit Space with Admissible Representation which is not a Limit Space ⋮ Can partial indexings be totalized? ⋮ On effective topological spaces ⋮ Recursively enumerable reals and Chaitin \(\Omega\) numbers ⋮ Type 2 computational complexity of functions on Cantor's space ⋮ Computable one-to-one enumerations of effective domains ⋮ Representations versus numberings: On the relationship of two computability notions ⋮ Control structures in hypothesis spaces: The influence on learning ⋮ The Church-Turing Thesis over Arbitrary Domains ⋮ Precomplete numberings ⋮ Computability on computable metric spaces ⋮ A refined model of computation for continuous problems ⋮ Some applications of computable one-one numberings ⋮ Infinite hypergraphs. I: Basic properties ⋮ Constructing best approximations on a Jordan curve ⋮ Computable invariance ⋮ A domain-theoretic approach to computability on the real line ⋮ Feasible real random access machines ⋮ Computability on the probability measures on the Borel sets of the unit interval ⋮ Some universality results for dynamical systems ⋮ The influence of domain interpretations on computational models ⋮ Computability on continuous, lower semi-continuous and upper semi-continuous real functions ⋮ The Turing closure of an Archimedean field ⋮ Computability on subsets of Euclidean space. I: Closed and compact subsets ⋮ Index sets in computable analysis ⋮ Analytic machines ⋮ Computable Banach spaces via domain theory ⋮ On approximate and algebraic computability over the real numbers ⋮ An effective Riemann Mapping Theorem ⋮ From axiomatics to intrinsic characterization: some open problems in computable analysis ⋮ Online computations of differentiable functions ⋮ Concrete models of computation for topological algebras ⋮ Computation by `While' programs on topological partial algebras ⋮ Computability on the probability measures on the Borel sets of the unit interval ⋮ Effectiveness of the global modulus of continuity on metric spaces ⋮ Computability structure of the Sobolev spaces and its applications ⋮ On the computability of fractal dimensions and Hausdorff measure ⋮ Constructing extensions of ultraweakly continuous linear functionals ⋮ Computable scalar fields: A basis for PDE software ⋮ An abstract data type for real numbers ⋮ Some aspects of studying an optimization or decision problem in different computational models ⋮ Using PVS to validate the algorithms of an exact arithmetic. ⋮ Integration in Real PCF ⋮ Admissibly Represented Spaces and Qcb-Spaces ⋮ Weihrauch Complexity in Computable Analysis ⋮ Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. ⋮ Topological properties of real number representations. ⋮ Effectively closed sets and graphs of computable real functions. ⋮ Foundation of a computable solid modelling. ⋮ Effective metric spaces and representations of the reals. ⋮ The closure properties on real numbers under limits and computable operators. ⋮ Extended admissibility. ⋮ Presentations of computably enumerable reals.

This page was built for publication: