The following pages link to Analytic machines (Q1292402):
Displaying 11 items.
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- Representation theorems for analytic machines and computability of analytic functions (Q693052) (← links)
- Computability in linear algebra (Q703545) (← links)
- Abstract geometrical computation. III: Black holes for classical and analog computing (Q734212) (← links)
- A topological view on algebraic computation models (Q1679677) (← links)
- Abstract geometrical computation. V: Embedding computable analysis (Q1761691) (← links)
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism (Q2637708) (← links)
- Computability of Analytic Functions with Analytic Machines (Q3576057) (← links)
- Kolmogorov-Complexity Based on Infinite Computations (Q3644713) (← links)
- Kolmogorov Complexity Theory over the Reals (Q4918012) (← links)
- Revising Type-2 Computation and Degrees of Discontinuity (Q4921445) (← links)