The following pages link to New Computational Paradigms (Q5717084):
Displaying 14 items.
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- A characterization of computable analysis on unbounded domains using differential equations (Q719239) (← links)
- On approximate and algebraic computability over the real numbers (Q1292404) (← links)
- On constructive number fields and computability of solutions of PDEs (Q1707150) (← links)
- Computable aggregations (Q2198216) (← links)
- Computability in harmonic analysis (Q2671298) (← links)
- Relevance and feasibility of mathematical analysis on the computer. Proceedings of a symposium held at the Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan, March 21--22, 2000 (Q2756596) (← links)
- Three lectures on real computation (Q2776268) (← links)
- Calculabilité en analyse (Q3089973) (← links)
- Some Elementary Results About the Equivalence of Computability and Decidability (Q3982257) (← links)
- Computability in analysis and physics (Q3994907) (← links)
- (Q4371021) (← links)
- (Q4373560) (← links)
- Computability Models: Algebraic, Topological and Geometric Algorithms (Q5886546) (← links)