Results 1  10
of
29
Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
 Bulletin of Symbolic Logic
, 1997
"... We present a survey of the recent applications of continuous domains for providing simple computational models for classical spaces in mathematics including the real line, countably based locally compact spaces, complete separable metric spaces, separable Banach spaces and spaces of probability dist ..."
Abstract

Cited by 48 (10 self)
 Add to MetaCart
We present a survey of the recent applications of continuous domains for providing simple computational models for classical spaces in mathematics including the real line, countably based locally compact spaces, complete separable metric spaces, separable Banach spaces and spaces of probability distributions. It is shown how these models have a logical and effective presentation and how they are used to give a computational framework in several areas in mathematics and physics. These include fractal geometry, where new results on existence and uniqueness of attractors and invariant distributions have been obtained, measure and integration theory, where a generalization of the Riemann theory of integration has been developed, and real arithmetic, where a feasible setting for exact computer arithmetic has been formulated. We give a number of algorithms for computation in the theory of iterated function systems with applications in statistical physics and in period doubling route to chao...
The Realizability Approach to Computable Analysis and Topology
, 2000
"... policies, either expressed or implied, of the NSF, NAFSA, or the U.S. government. ..."
Abstract

Cited by 41 (19 self)
 Add to MetaCart
policies, either expressed or implied, of the NSF, NAFSA, or the U.S. government.
Properly Injective Spaces and Function Spaces
, 1997
"... Given an injective space D (a continuous lattice endowed with the Scott topology) and a subspace embedding j : X ! Y , Dana Scott asked whether the higherorder function [X ! D] ! [Y ! D] which takes a continuous map f : X ! D to its greatest continuous extension ¯ f : Y ! D along j is Scott continu ..."
Abstract

Cited by 28 (13 self)
 Add to MetaCart
Given an injective space D (a continuous lattice endowed with the Scott topology) and a subspace embedding j : X ! Y , Dana Scott asked whether the higherorder function [X ! D] ! [Y ! D] which takes a continuous map f : X ! D to its greatest continuous extension ¯ f : Y ! D along j is Scott continuous. In this case the extension map is a subspace embedding. We show that the extension map is Scott continuous iff D is the trivial onepoint space or j is a proper map in the sense of Hofmann and Lawson. In order to avoid the ambiguous expression "proper subspace embedding", we refer to proper maps as finitary maps. We show that the finitary sober subspaces of the injective spaces are exactly the stably locally compact spaces. Moreover, the injective spaces over finitary embeddings are the algebras of the upper power space monad on the category of sober spaces. These coincide with the retracts of upper power spaces of sober spaces. In the full subcategory of locally compact sober spaces, t...
The Measurement Process in Domain Theory
 Proceedings of the 27 th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science
, 2000
"... We introduce the measurement idea in domain theory and then apply it to establish two fixed point theorems. The first is an extension of the Scott fixed point theorem which applies to nonmonotonic mappings. The second is a contraction principle for monotone maps that guarantees the existence of uniq ..."
Abstract

Cited by 26 (19 self)
 Add to MetaCart
We introduce the measurement idea in domain theory and then apply it to establish two fixed point theorems. The first is an extension of the Scott fixed point theorem which applies to nonmonotonic mappings. The second is a contraction principle for monotone maps that guarantees the existence of unique fixed points. 1
Computable Banach Spaces via Domain Theory
 Theoretical Computer Science
, 1998
"... This paper extends the ordertheoretic approach to computable analysis via continuous domains to complete metric spaces and Banach spaces. We employ the domain of formal balls to define a computability theory for complete metric spaces. For Banach spaces, the domain specialises to the domain of clos ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
This paper extends the ordertheoretic approach to computable analysis via continuous domains to complete metric spaces and Banach spaces. We employ the domain of formal balls to define a computability theory for complete metric spaces. For Banach spaces, the domain specialises to the domain of closed balls, ordered by reversed inclusion. We characterise computable linear operators as those which map computable sequences to computable sequences and are effectively bounded. We show that the domaintheoretic computability theory is equivalent to the wellestablished approach by PourEl and Richards. 1 Introduction This paper is part of a programme to introduce the theory of continuous domains as a new approach to computable analysis. Initiated by the various applications of continuous domain theory to modelling classical mathematical spaces and performing computations as outlined in the recent survey paper by Edalat [6], the authors started this work with [9] which was concerned with co...
Domain Representations of Partial Functions, with Applications to Spatial Objects and Constructive Volume Geometry
, 2000
"... A partial spatial object is a partial map from space to data. Data types of partial spatial objects are modelled by topological algebras of partial maps and are the foundation for a high level approach to volume graphics called constructive volume geometry (CVG), where space and data are subspaces o ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
A partial spatial object is a partial map from space to data. Data types of partial spatial objects are modelled by topological algebras of partial maps and are the foundation for a high level approach to volume graphics called constructive volume geometry (CVG), where space and data are subspaces of # dimensional Euclidean space. We investigate the computability of partial spatial object data types, in general and in volume graphics, using the theory of effective domain representations for topological algebras. The basic mathematical problem considered is to classify which partial functions between topological spaces can be represented by total continuous functions between given domain representations of the spaces. We prove theorems about partial functions on regular Hausdorff spaces and their domain representations, and apply the results to partial spatial objects and CVG algebras.
Reducibility of Domain Representations and CantorWeihrauch Domain Representations
, 2006
"... We introduce a notion of reducibility of representations of topological spaces and study some basic properties of this notion for domain representations. A representation reduces to another if its representing map factors through the other representation. Reductions form a preorder on representatio ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
We introduce a notion of reducibility of representations of topological spaces and study some basic properties of this notion for domain representations. A representation reduces to another if its representing map factors through the other representation. Reductions form a preorder on representations. A spectrum is a class of representations divided by the equivalence relation induced by reductions. We establish some basic properties of spectra, such as, nontriviality. Equivalent representations represent the same set of functions on the represented space. Within a class of representations, a representation is universal if all representations in the class reduce to it. We show that notions of admissibility, considered both for domains and within Weihrauch’s TTE, are universality concepts in the appropriate spectra. Viewing TTE representations as domain representations, the reduction notion here is a natural generalisation of the one from TTE. To illustrate the framework, we consider some domain representations of real numbers and show that the usual interval domain representation, which is universal among dense representations, does not reduce to various Cantor domain representations. On the other hand, however, we show that a substructure of the interval domain more suitable for efficient computation of operations is equivalent to the usual interval domain with respect to reducibility. 1.
Integration in real PCF
 Information and Computation
, 1996
"... Real PCF is an extension of the programming language PCF with a data type for real numbers. Although a Real PCF definable real number cannot be computed in finitely many steps, it is possible to compute an arbitrarily small rational interval containing the real number in a sufficiently large number ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Real PCF is an extension of the programming language PCF with a data type for real numbers. Although a Real PCF definable real number cannot be computed in finitely many steps, it is possible to compute an arbitrarily small rational interval containing the real number in a sufficiently large number of steps. Based on a domaintheoretic approach to integration, we show how to define integration in Real PCF. We propose two approaches to integration in Real PCF. One consists in adding integration as primitive. The other consists in adding a primitive for function maximization and then recursively defining integration from maximization. In both cases we have a computational adequacy theorem for the corresponding extension of Real PCF. Moreover, based on previous work on Real PCF definability, we show that Real PCF extended with the maximization operator is universal. 1
Quantum Domain Theory  Definitions and Applications
 Proceedings of CCA’03
, 2003
"... Domain theory is a branch of classical computer science. It has proven to be a rigourous mathematical structure to describe denotational semantics for programming languages and to study the computability of partial functions. In this paper, we study the extension of domain theory to the quantum sett ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Domain theory is a branch of classical computer science. It has proven to be a rigourous mathematical structure to describe denotational semantics for programming languages and to study the computability of partial functions. In this paper, we study the extension of domain theory to the quantum setting. By defining a quantum domain we introduce a rigourous definition of quantum computability for quantum states and operators. Furthermore we show that the denotational semantics of quantum computation has the same structure as the denotational semantics of classical probabilistic computation introduced by Kozen [23]. Finally, we briefly review a recent result on the application of quantum domain theory to quantum information processing. 1
Admissible Domain Representations of Topological Spaces
 Department of Mathematics, Uppsala University
, 2005
"... In this paper we consider admissible domain representations of topological spaces. A domain representation D of a space X is λadmissible if, in principle, all other λbased domain representations E of X can be reduced to D via a continuous function from E to D. We present a characterisation theorem ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
In this paper we consider admissible domain representations of topological spaces. A domain representation D of a space X is λadmissible if, in principle, all other λbased domain representations E of X can be reduced to D via a continuous function from E to D. We present a characterisation theorem of when a topological space has a λadmissible and κbased domain representation. We also prove that there is a natural cartesian closed category of countably based and countably admissible domain representations. These results are generalisations of [Sch02]. 1