scientific article; zbMATH DE number 3987247

MaRDI QIDQ3751553zbMATH OpenFDO

Authors Klaus Weihrauch

Publication date 1987

Recommendations

scientific article; zbMATH DE number 5778850
scientific article; zbMATH DE number 480999
Computability theory
The Foundations of Computability Theory
Computability

Cited in

(only showing first 100 items - show all)

Computability in Specification
Some aspects of studying an optimization or decision problem in different computational models
Recursive quasi-metric spaces.
Type 2 recursion theory
scientific article; zbMATH DE number 3992928 (Why is no real title available?)
On approximate and algebraic computability over the real numbers
Randomness and universal machines
scientific article; zbMATH DE number 1285742 (Why is no real title available?)
Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
Recursively enumerable reals and Chaitin \(\Omega\) numbers
Presentations of computably enumerable reals.
Completion of choice
Feasible real random access machines
Effective metric spaces and representations of the reals.
Recursive Polish spaces
Representations of the real numbers and of the open subsets of the set of real numbers
scientific article; zbMATH DE number 1909825 (Why is no real title available?)
Computability on computable metric spaces
Online computations of differentiable functions
General computability theory (a database of articles and books)
A natural weak limit space with admissible representation which is not a limit space
Infinite hypergraphs. I: Basic properties
Admissibly Represented Spaces and Qcb-Spaces
Computability on the probability measures on the Borel sets of the unit interval
On the time complexity of partial real functions
How much partiality is needed for a theory of computability?
Some universality results for dynamical systems
An abstract data type for real numbers
scientific article; zbMATH DE number 5354044 (Why is no real title available?)
A refined model of computation for continuous problems
Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)
A comparison of certain representations of regularly closed sets
Computability on subsets of Euclidean space. I: Closed and compact subsets
Integration in Real PCF
PCF extended with real numbers
Computable Banach spaces via domain theory
On Kurtz randomness
Control structures in hypothesis spaces: The influence on learning
Small universal register machines
Computable invariance
The closure properties on real numbers under limits and computable operators.
First steps in synthetic computability theory
Computable one-to-one enumerations of effective domains
Representations versus numberings: On the relationship of two computability notions
scientific article; zbMATH DE number 4088936 (Why is no real title available?)
The concept of computability
A notion of information related to computation
Topological properties of real number representations.
Index sets in computable analysis
Computability and Recursion
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
Computational complexity of iterated maps on the interval
Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
Analytic machines
The Turing closure of an Archimedean field
An abstract data type for real numbers
Numberings, c.e. oracles, and fixed points
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
Precomplete numberings
Computability on continuous, lower semi-continuous and upper semi-continuous real functions
Using PVS to validate the algorithms of an exact arithmetic.
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
Fast online multiplication of real numbers
Constructing best approximations on a Jordan curve
Compactness in constructive analysis revisited
Feasible real random access machines
Predication and computable concepts
The influence of domain interpretations on computational models
Can partial indexings be totalized?
THE DISCONTINUITY PROBLEM
Computational foundations of basic recursive function theory
On the complexity of online computations of real functions
scientific article; zbMATH DE number 478433 (Why is no real title available?)
Effective Borel measurability and reducibility of functions
Weihrauch Complexity in Computable Analysis
Computability and human symbolic output
A compositional axiomatization of statecharts
On effective topological spaces
Concrete models of computation for topological algebras
Computation by `While' programs on topological partial algebras
Computability with low-dimensional dynamical systems
Random elements in effective topological spaces with measure.
Constructing extensions of ultraweakly continuous linear functionals
A domain-theoretic approach to computability on the real line
On the computability of fractal dimensions and Hausdorff measure
Effective hierarchy of real numbers.
Extended admissibility.
Foundation of a computable solid modelling.
On the algebraic structure of Weihrauch degrees
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
Computable scalar fields: A basis for PDE software
An effective Riemann Mapping Theorem

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)