The following pages link to (Q3262213):
Displaying 13 items.
- Choice and complexity (Q581191) (← links)
- A computable version of Banach's inverse mapping theorem (Q1006604) (← links)
- Computing with infinite objects (Q1158755) (← links)
- Embedding metric spaces into CPO's (Q1164416) (← links)
- Computation on metric spaces via domain theory (Q1295303) (← links)
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I (Q1295392) (← links)
- Recursive quasi-metric spaces. (Q1427771) (← links)
- Constructive metrisability in point-free topology. (Q1427775) (← links)
- Computability on computable metric spaces (Q1802069) (← links)
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations (Q1885034) (← links)
- An abstract data type for real numbers (Q1960529) (← links)
- La théorie des fonctions récursives et ses applications. (Exposé d'information générale) (Q5536266) (← links)
- COMPUTABLY COMPACT METRIC SPACES (Q6170503) (← links)
