The following pages link to Index sets in computable analysis (Q1292400):
Displaying 13 items.
- Decision problems for Turing machines (Q990079) (← links)
- The number of nonequivalent computable indexations for a fixed family of sets (Q1317638) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- Outline of partial computability in computable topology (Q2011636) (← links)
- Computable analysis and classification problems (Q2106595) (← links)
- Index sets for computable differential equations (Q3159419) (← links)
- Rice’s Theorem in Effectively Enumerable Topological Spaces (Q3195700) (← links)
- On Index Sets of Some Properties of Computable Algebras (Q3576209) (← links)
- Computable elements and functions in effectively enumerable topological spaces (Q4593240) (← links)
- (Q4764107) (← links)
- Effectiveness for Embedded Spheres and Balls (Q4916189) (← links)
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES (Q5855756) (← links)
- COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM (Q5858927) (← links)