The following pages link to (Q3722498):
Displayed 12 items.
- Three concepts of decidability for general subsets of uncountable spaces (Q817852) (← links)
- On the complexity of online computations of real functions (Q1186506) (← links)
- Computability on subsets of Euclidean space. I: Closed and compact subsets (Q1292398) (← links)
- Computability on the probability measures on the Borel sets of the unit interval (Q1292415) (← links)
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I (Q1295392) (← links)
- Recursive characterization of computable real-valued functions and relations (Q1349924) (← links)
- A blend of methods of recursion theory and topology. (Q1412834) (← links)
- Computability on subsets of metric spaces. (Q1427773) (← links)
- Computability on computable metric spaces (Q1802069) (← links)
- Computability on the probability measures on the Borel sets of the unit interval (Q4571949) (← links)
- Theses for Computation and Recursion on Concrete and Abstract Structures (Q4637218) (← links)
- Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis (Q4916185) (← links)