Complexity spaces as quantitative domains of computation

DOI10.1016/j.topol.2011.01.005zbMath1233.06005OpenAlexW2081459260MaRDI QIDQ536037

Salvador Romaguera, Oscar Valero, Michel Schellekens

Publication date: 16 May 2011

Published in: Topology and its Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/48240

zbMATH Keywords

computational complexityquantitative domaincontinuous domaincomplexity spacepointed complexity spaceScot topology

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Metric spaces, metrizability (54E35) Continuous lattices and posets, applications (06B35)

Related Items (8)

Quasi-metric properties of the dual cone of an asymmetric normed space ⋮ A fixed point theorem for preordered complete fuzzy quasi-metric spaces and an application ⋮ On fixed point theory in partial metric spaces ⋮ A domain-theoretic approach to fuzzy metric spaces ⋮ On the construction of domains of formal balls for uniform spaces ⋮ Fixed point theorems in generalized metric spaces with applications to computer science ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ Fixed points of contractive maps on dcpo's

Cites Work

• Unnamed Item
• Unnamed Item
• Applications of the complexity space to the general probabilistic divide and conquer algorithms
• A computational model for metric spaces
• Approximation of metric spaces by partial metric spaces
• Sequence spaces and asymmetric norms in the theory of computational complexity.
• A characterization of partial metrizability: Domains are quantifiable.
• Quasi-metric properties of complexity spaces
• Quantitative continuous domains
• The constructive maximal point space and partial metrizability
• The complexity space of partial functions: a connection between complexity analysis and denotational semantics
• An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
• A quantitative computational model for complete partial metric spaces via formal balls
• The Smyth Completion
• Partial Metric Topology
• Continuous Lattices and Domains
• Duality and quasi-normability for complexity spaces
• On the structure of the space of complexity partial functions
• Partial metrisability of continuous posets

This page was built for publication: Complexity spaces as quantitative domains of computation