The following pages link to (Q3778751):
Displayed 11 items.
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303) (← links)
- Computability on subsets of Euclidean space. I: Closed and compact subsets (Q1292398) (← links)
- Index sets in computable analysis (Q1292400) (← links)
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I (Q1295392) (← links)
- A theory of nonmonotonic rule systems I (Q1356221) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- On the computational complexity of best Chebyshev approximations (Q1821775) (← links)
- Computable symbolic dynamics (Q3528142) (← links)
- Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis (Q4916185) (← links)
- Effective Symbolic Dynamics (Q4918032) (← links)
- COMPUTABLY COMPACT METRIC SPACES (Q6170503) (← links)