𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of computing topological degree of lipschitz functions in n dimensions

✍ Scribed by T Boult; K Sikorski

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
756 KB
Volume
2
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Turing degrees of points in computabl
On Turing degrees of points in computable topology
✍ Iraj Kalantari; Larry Welch πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 169 KB

## Abstract This paper continues our study of computable point‐free topological spaces and the metamathematical points in them. For us, a __point__ is the intersection of a sequence of basic open sets with compact and nested closures. We call such a sequence a __sharp filter__. A function __f~F~__