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)

The influence of domain interpretations on computational models
Type 2 recursion theory
Compactness in constructive analysis revisited
Representations of the real numbers and of the open subsets of the set of real numbers
A notion of information related to computation
On the complexity of online computations of real functions
A compositional axiomatization of statecharts
A refined model of computation for continuous problems
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 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
Handbook of computability theory
Computational foundations of basic recursive function theory
Computability with low-dimensional dynamical systems
Small universal register machines
Recursive characterization of computable real-valued functions and relations
PCF extended with real numbers
Random elements in effective topological spaces with measure.
Recursive quasi-metric spaces.
The concept of computability
Computability on continuous, lower semi-continuous and upper semi-continuous real functions
The Turing closure of an Archimedean field
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.
A topological view on algebraic computation models
Computability on computable metric spaces
Infinite hypergraphs. I: Basic properties
Constructing extensions of ultraweakly continuous linear functionals
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
Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
On Kurtz randomness
An abstract data type for real numbers
On the time complexity of partial real functions
Precomplete numberings
Completion of choice
Type 2 computational complexity of functions on Cantor's space
Computable scalar fields: A basis for PDE software
Can partial indexings be totalized?
Some universality results for dynamical systems
First steps in synthetic computability theory
General computability theory (a database of articles and books)
Computability and human symbolic output
Effective Borel measurability and reducibility of functions
Computability in Specification
scientific article; zbMATH DE number 5354044 (Why is no real title available?)
scientific article; zbMATH DE number 4088936 (Why is no real title available?)
scientific article; zbMATH DE number 41860 (Why is no real title available?)
scientific article; zbMATH DE number 1285742 (Why is no real title available?)
scientific article; zbMATH DE number 478433 (Why is no real title available?)
On effective topological spaces
Computational complexity of iterated maps on the interval
On the algebraic structure of Weihrauch degrees
An abstract data type for real numbers
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
Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
scientific article; zbMATH DE number 3992928 (Why is no real title available?)
scientific article; zbMATH DE number 1909825 (Why is no real title available?)
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
Admissibly Represented Spaces and Qcb-Spaces
Weihrauch Complexity in Computable Analysis
Fast online multiplication of real numbers
From imperative to rule-based graph programs
Predication and computable concepts
Effective hierarchy of real numbers.
The Church-Turing Thesis over Arbitrary Domains
Computability and Recursion
Computable one-to-one enumerations of effective domains
Recursively enumerable reals and Chaitin \(\Omega\) numbers
Representations versus numberings: On the relationship of two computability notions
Control structures in hypothesis spaces: The influence on learning
Numberings, c.e. oracles, and fixed points
Recursive Polish spaces
THE DISCONTINUITY PROBLEM
How much partiality is needed for a theory of computability?

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)