Complexity spaces as quantitative domains of computation

DOI10.1016/J.TOPOL.2011.01.005MaRDI QIDQ536037zbMATH OpenOpenAlexFDO

Authors Salvador Romaguera, M. Schellekens, O. Valero

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

complexity spacecomputational complexitycontinuous domainpointed complexity spacequantitative domainScot topology

Mathematics Subject Classification ID

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

Recommendations

• An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
• scientific article; zbMATH DE number 1258313
• On the structure of the space of complexity partial functions
• Fundamentals of Computation Theory
• The complexity probabilistic quasi-metric space

Cites work

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

Cited in

(15)

• Characterization of realizable space complexities
• New perspectives of granular computing in relation geometry induced by pairings
• Quasi-metric properties of the dual cone of an asymmetric normed space
• Fixed point theorems in generalized metric spaces with applications to computer science
• A fixed point theorem for preordered complete fuzzy quasi-metric spaces and an application
• On the construction of domains of formal balls for uniform spaces
• An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
• On fixed point theory in partial metric spaces
• A domain-theoretic approach to fuzzy metric spaces
• scientific article; zbMATH DE number 1258313 (Why is no real title available?)
• scientific article; zbMATH DE number 1543339 (Why is no real title available?)
• Fundamentals of Computation Theory
• Fixed points of contractive maps on dcpo's
• Intrinsic approach spaces on domains
• Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q536037)