scientific article; zbMATH DE number 3987247
From MaRDI portal
Publication:3751553
zbMATH Open0611.03002MaRDI QIDQ3751553FDOQ3751553
Publication date: 1987
Title of this publication is not available (Why is that?)
productivitycomputational complexitysemanticsrecursively enumerable setsChurch's thesisrecursion theorempartial recursive functionsnumberingsrecursive setsunsolvable problemsreducibilitiesKleene hierarchytheory of representationsrecursion analysistype 2 theory of constructivity and computability
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Computability and recursion theory (03Dxx)
Cited In (96)
- Type 2 recursion theory
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- On approximate and algebraic computability over the real numbers
- Title not available (Why is that?)
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
- Randomness and universal machines
- Effective metric spaces and representations of the reals.
- Title not available (Why is that?)
- Computability on computable metric spaces
- Representations of the real numbers and of the open subsets of the set of real numbers
- Online computations of differentiable functions
- Infinite hypergraphs. I: Basic properties
- Computability on the probability measures on the Borel sets of the unit interval
- Some universality results for dynamical systems
- Title not available (Why is that?)
- A refined model of computation for continuous problems
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Integration in Real PCF
- Control structures in hypothesis spaces: The influence on learning
- PCF extended with real numbers
- On Kurtz randomness
- Computable Banach spaces via domain theory
- Representations versus numberings: On the relationship of two computability notions
- Small universal register machines
- Computable invariance
- Title not available (Why is that?)
- Computable one-to-one enumerations of effective domains
- Computability and Recursion
- Topological properties of real number representations.
- A notion of information related to computation
- Index sets in computable analysis
- Some applications of computable one-one numberings
- Effectiveness of the global modulus of continuity on metric spaces
- From axiomatics to intrinsic characterization: some open problems in computable analysis
- Computability structure of the Sobolev spaces and its applications
- Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
- Computational complexity of iterated maps on the interval
- Analytic machines
- An abstract data type for real numbers
- The Turing closure of an Archimedean field
- Recursive characterization of computable real-valued functions and relations
- A topological view on algebraic computation models
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Computability on continuous, lower semi-continuous and upper semi-continuous real functions
- Using PVS to validate the algorithms of an exact arithmetic.
- Fast online multiplication of real numbers
- Constructing best approximations on a Jordan curve
- Compactness in constructive analysis revisited
- Feasible real random access machines
- The influence of domain interpretations on computational models
- THE DISCONTINUITY PROBLEM
- On the complexity of online computations of real functions
- Title not available (Why is that?)
- Effective Borel measurability and reducibility of functions
- Computability and human symbolic output
- On effective topological spaces
- A compositional axiomatization of statecharts
- Concrete models of computation for topological algebras
- Computation by `While' programs on topological partial algebras
- Random elements in effective topological spaces with measure.
- Computability of Partial Delaunay Triangulation and Voronoi Diagram [Extended Abstract]
- Computability with low-dimensional dynamical systems
- A domain-theoretic approach to computability on the real line
- On the computability of fractal dimensions and Hausdorff measure
- Extended admissibility.
- Foundation of a computable solid modelling.
- From imperative to rule-based graph programs
- Effectively closed sets and graphs of computable real functions.
- Type 2 computational complexity of functions on Cantor's space
- The Church-Turing Thesis over Arbitrary Domains
- Computable scalar fields: A basis for PDE software
- An effective Riemann Mapping Theorem
- A learning-theoretic characterization of classes of recursive functions
- Recursive quasi-metric spaces.
- Feasible real random access machines
- Presentations of computably enumerable reals.
- Completion of choice
- Recursive Polish spaces
- Admissibly Represented Spaces and Qcb-Spaces
- How much partiality is needed for a theory of computability?
- An abstract data type for real numbers
- On the time complexity of partial real functions
- The closure properties on real numbers under limits and computable operators.
- The concept of computability
- Numberings, c.e. oracles, and fixed points
- Precomplete numberings
- Computability on the probability measures on the Borel sets of the unit interval
- A comparison of concepts from computable analysis and effective descriptive set theory
- Can partial indexings be totalized?
- A Natural Weak Limit Space with Admissible Representation which is not a Limit Space
- Weihrauch Complexity in Computable Analysis
- Constructing extensions of ultraweakly continuous linear functionals
- A Comparison of Certain Representations of Regularly Closed Sets
- On the algebraic structure of Weihrauch degrees
- Computability in Specification
- Some aspects of studying an optimization or decision problem in different computational models
Recommendations
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 Q3751553)
