Results 1  10
of
17
Quasimetric Properties of Complexity Spaces
 Topology Appl
, 1999
"... The complexity (quasimetric) space has been introduced as a part of the development of a topological foundation for the complexity analysis of algorithms ([12]). Applications of this theory to the complexity analysis of Divide & Conquer algorithms have been discussed in [12]. Here we obtain ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
The complexity (quasimetric) space has been introduced as a part of the development of a topological foundation for the complexity analysis of algorithms ([12]). Applications of this theory to the complexity analysis of Divide & Conquer algorithms have been discussed in [12]. Here we obtain several quasimetric properties of the complexity space. The main results obtained are the Smythcompleteness of the complexity space and the compactness of closed complexity spaces which possess a (complexity) lower bound. Finally, some implications of these results in connection to the above mentioned complexity analysis techniques are discussed and the total boundedness of complexity spaces with a lower bound is discussed in the light of Smyth's computational interpretation of this property ([14]). AMS (1991) Subject Classification: 54E15, 54E35, 54C30, 54C35. 1 Introduction The letters N , !, R and R + denote the set of positive integers, of nonnegative integers, of real numbers ...
On the Yoneda completion of a quasimetric space
 Theoretical Computer Science
, 2002
"... Several theories aimed at reconciling the partial order and the metric space approaches to Domain Theory have been presented in the literature (e.g. [FK97], [BvBR9 8], [Smy89] and [Wag94]). We focus in this paper on two of these approaches: the Yoneda completion of generalized metric spaces of [BvBR ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
Several theories aimed at reconciling the partial order and the metric space approaches to Domain Theory have been presented in the literature (e.g. [FK97], [BvBR9 8], [Smy89] and [Wag94]). We focus in this paper on two of these approaches: the Yoneda completion of generalized metric spaces of [BvBR98], which finds its roots in work by Lawvere ([Law73], cf. also [Wag94]) and which is related to early work by Stoltenberg (e.g. [Sto67], [Sto67a] and [FG84]), and the Smyth completion ([Smy89],[Smy91],[Smy94],[Sun93] and [Sun95]). A netversion of the Yoneda completion, complementing the netversion of the Smyth completion ([Sun95]), is given and a comparison between the two types of completion is presented. The following open question is raised in [BvBR98]: &quot;An interesting question is to characterize the family of generalized metric spaces for which [the Yoneda] completion is idempotent (it contains at least all ordinary metric spaces).&quot; We show that the largest class of quasimetric spaces idempotent under the Yoneda completion is precisely the class of Smythcompletable spaces. A similar result has been obtained independently by B. Flagg and P. Sünderhauf in [FS96]
QuasiUniform Completeness In Terms Of Cauchy Nets
 Acta Mathematica Hungarica
, 1993
"... . The notion of completeness for quasiuniform spaces developed in [Smy93] and [Sun93] is presented in terms of nets rather than filters. As a byproduct, we get a new characterisation of completability and the result that for all completable spaces the Smythcompletion coincides with the wellknown ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
. The notion of completeness for quasiuniform spaces developed in [Smy93] and [Sun93] is presented in terms of nets rather than filters. As a byproduct, we get a new characterisation of completability and the result that for all completable spaces the Smythcompletion coincides with the wellknown bicompletion of [FL82]. Totally bounded spaces are singled out to belong to the class of completable quasiuniform spaces. Introduction In [Smy93] and [Sun93], a theory of completion and completeness for quasiuniform spaces is developed. This paper presents completeness in terms of nets rather than filters. The usual way to pass from filters to nets by choosing arbitrary elements from the sets in the filter does not work in the nonsymmetric case of quasiuniformities. The reason for this is that our Cauchy filters do not contain sets which are arbitrarily small in an absolute sense, hence the resulting net need not be Cauchy. The completion of [Smy93] and [Sun93] is performed in a larger c...
The Essence of Ideal Completion in Quantitative Form
 GHK
, 1996
"... This paper is part of the ongoing foundational work on quantitative domain theory [Smy88,BvBR95,Rut96,FWS96,Sun94,Wag94], which refines ordinary domain theory by replacing the qualitative notion of approximation by a quantitative notion of degree of approximation (cf. the introduction of [FWS96]). ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This paper is part of the ongoing foundational work on quantitative domain theory [Smy88,BvBR95,Rut96,FWS96,Sun94,Wag94], which refines ordinary domain theory by replacing the qualitative notion of approximation by a quantitative notion of degree of approximation (cf. the introduction of [FWS96]). We investigate the generalization of ideal completion of posets for quantitative domains suggested in [BvBR95] and [FWS96].
Complexity Spaces Revisited (Extended Abstract)
"... The complexity (quasipseudometric) spaces have been introduced as part of the development of a topological foundation for the complexity analysis of algorithms ([Sch95]). Applications of this theory to the complexity analysis of Divide & Conquer algorithms have been discussed in [Sch95]. Typic ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
The complexity (quasipseudometric) spaces have been introduced as part of the development of a topological foundation for the complexity analysis of algorithms ([Sch95]). Applications of this theory to the complexity analysis of Divide & Conquer algorithms have been discussed in [Sch95]. Typically these applications involve fixed point arguments based on the Smyth completion. The notion of Scomplet...
Approximation in quantaleenriched categories
 DIRK HOFMANN AND PAWE L WASZKIEWICZ
, 2010
"... ar ..."
(Show Context)
Constructing a QuasiUniform Function Space
, 1993
"... This paper attacks the problem of constructing function spaces for a convenient class of quasiuniform spaces. As, for the sake of completeness, multivalued functions have to be considered, we define a suitable power space functor. The arising monad is a computational monad in the sense of Eugenio ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper attacks the problem of constructing function spaces for a convenient class of quasiuniform spaces. As, for the sake of completeness, multivalued functions have to be considered, we define a suitable power space functor. The arising monad is a computational monad in the sense of Eugenio Moggi. The tensorial strength thus given enables us to lift the usual product to a symmetric tensor product on the Kleislicategory of the monad. It is now possible to define a function space constructor yielding a symmetric monoidal closed category. As an example, we give a convenient model for the real numbers in this category.
Discrete Approximation of Spaces  A Uniform Approach to Topologically Structured Datatypes and their Function Spaces
, 1994
"... ..."
Function Spaces for Uniformly Locally Bounded QuasiUniform Spaces
, 1995
"... In a previous paper [Sün95b], we described a function space constructor for complete totally bounded quasiuniform spaces. The present paper generalizes this construction to the wider class of uniformly locally bounded spaces, which is contained in the class of all completable spaces. Based on th ..."
Abstract
 Add to MetaCart
In a previous paper [Sün95b], we described a function space constructor for complete totally bounded quasiuniform spaces. The present paper generalizes this construction to the wider class of uniformly locally bounded spaces, which is contained in the class of all completable spaces. Based on this, a refined function space construction is introduced. The latter seems more appropriate for the uniform case and for certain applications in programming semantics. The constructions are wellbehaved with regard to uniform local boundedness and completability.