In computable analysis recursive metric spaces play an important role, since these are, roughly speaking, spaces with computable metric and limit operation. Unfortunately, the concept of a metric space is not powerful enough to capture all interesting phenomena which occur in computable analysis. So
β¦ LIBER β¦
Quasi-metric tree in -quasi-metric spaces
β Scribed by Olela Otafudu, Olivier
- Book ID
- 121209462
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 239 KB
- Volume
- 160
- Category
- Article
- ISSN
- 0166-8641
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Recursive quasi-metric spaces
β
Vasco Brattka
π
Article
π
2003
π
Elsevier Science
π
English
β 441 KB
Endpoints in -quasi-metric spaces
β
Agyingi, Collins Amburo; Haihambo, Paulus; KΓΌnzi, Hans-Peter A.
π
Article
π
2014
π
Elsevier Science
π
English
β 313 KB
Bicompleting weightable quasi-metric spa
β
S. Oltra; S. Romaguera; E. A. SΓ‘nchez-PΓ©rez
π
Article
π
2002
π
Springer Milan
π
Italian
β 147 KB
Metrizability of Quasi-Metric Spaces
β
Raghavan, T. G.; Reilly, I. L.
π
Article
π
1977
π
Oxford University Press
π
English
β 110 KB
Embedding quasi-metric spaces in Hilbert
β
Pham Son
π
Article
π
1982
π
Springer
π
English
β 271 KB
Quasi-metric properties of complexity sp
β
S. Romaguera; M. Schellekens
π
Article
π
1999
π
Elsevier Science
π
English
β 110 KB
The complexity (quasi-metric) space has been introduced as a part of the development of a topological foundation for the complexity analysis of algorithms . Applications of this theory to the complexity analysis of Divide and Conquer algorithms have been discussed by . Here we obtain several quasi-