On the structure of the space of complexity partial functions

DOI10.1080/00207160701210117zbMATH Open1146.68376OpenAlexW2135781342MaRDI QIDQ5459746FDOQ5459746

O. Valero, Salvador Romaguera

Publication date: 29 April 2008

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160701210117

Recommendations

• An extension of the dual complexity space and an application to computer science
• The dual complexity space as the dual of a normed cone
• An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
• The complexity space of partial functions: a connection between complexity analysis and denotational semantics
• Sequence spaces and asymmetric norms in the theory of computational complexity.

zbMATH Keywords

symbolic computationextended quasi-metricordered coneright \(K\)-Cauchy sequence

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Metric spaces, metrizability (54E35) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Ordered semigroups and monoids (06F05) Complete metric spaces (54E50)

Cites Work

• The correspondence between partial metrics and semivaluations
• Sequence spaces and asymmetric norms in the theory of computational complexity.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Continuous Lattices and Domains
• Quasi-metric properties of complexity spaces
• Partial metric monoids and semivaluation spaces
• Title not available (Why is that?)
• Ordered cones and approximation
• Denotational models for programming languages: Applications of Banach's fixed point theorem
• Title not available (Why is that?)
• Lengths on semigroups and groups
• The quasi-metric of complexity convergence

Cited In (17)

• The complexity probabilistic quasi-metric space
• The Hausdorff fuzzy quasi-metric
• On the time complexity of partial real functions
• Sequence spaces and asymmetric norms in the theory of computational complexity.
• A quasi-metric computational model from modular functions on monoids
• An extension of the dual complexity space and an application to computer science
• Hyperspaces of a weightable quasi-metric space: application to models in the theory of computation
• A fixed point theorem for preordered complete fuzzy quasi-metric spaces and an application
• THE A-COMPLEXITY OF A SPACE
• Towards a Unified Complexity Theory of Total Functions
• 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
• Characterizations of quasi-metric and \(G\)-metric completeness involving \(w\)-distances and fixed points
• Title not available (Why is that?)
• Type 2 computational complexity of functions on Cantor's space
• Complexity spaces as quantitative domains of computation
• New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces

This page was built for publication: On the structure of the space of complexity partial functions

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