The kobayashi metric on complex spaces
โ Scribed by Sergio Venturini
- Publisher
- Springer
- Year
- 1996
- Tongue
- English
- Weight
- 831 KB
- Volume
- 305
- Category
- Article
- ISSN
- 0025-5831
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract We introduce a new Turing machine based concept of time complexity for functions on computable metric spaces. It generalizes the ordinary complexity of word functions and the complexity of real functions studied by Ko [19] et al. Although this definition of TIME as the maximum of a gene
In the present paper, the authors define F-open sets, F-closed sets, F-adherent points, F-limit points, F-isolated points, F-isolated sets, F-derived sets, F-closures, F-interior points, F-interior, F-exterior points, F-exterior, F-everywhere dense sets, F-nowhere dense sets and make some characteri