The following pages link to (Q5737081):
Displayed 18 items.
- Metric spaces in synthetic topology (Q651311) (← links)
- Domain representability of metric spaces (Q674414) (← links)
- A sequentially computable function that is not effectively continuous at any point (Q864424) (← links)
- On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis (Q1102283) (← links)
- Concrete models of computation for topological algebras (Q1292413) (← links)
- Computation by `While' programs on topological partial algebras (Q1292414) (← links)
- A Banach-Mazur computable but not Markov computable function on the computable real numbers (Q1765159) (← links)
- Computability on computable metric spaces (Q1802069) (← links)
- Formal spaces and their effective presentations (Q1902337) (← links)
- Recursive topological spaces (Q1921850) (← links)
- Completeness: when enough is enough (Q2003502) (← links)
- Computability of simple games: A characterization and application to the core (Q2482640) (← links)
- The concept of effective method applied to computational problems of linear algebra (Q2546145) (← links)
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces (Q2682909) (← links)
- Generalizing Computability Theory to Abstract Algebras (Q4637219) (← links)
- A Chain of Inclusion Relations in Computable Analysis (Q4769045) (← links)
- Separating notions in effective topology (Q6142834) (← links)
- COMPUTABLY COMPACT METRIC SPACES (Q6170503) (← links)