The following pages link to New Computational Paradigms (Q5717088):
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)
- Characterisation of limit measures of higher-dimensional cellular automata (Q1693998) (← links)
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism (Q2637708) (← links)
- Real hypercomputation and continuity (Q2642906) (← links)
- Relative computability and uniform continuity of relations (Q2930869) (← links)
- How constructive is constructing measures? (Q2987777) (← links)
- Computability of Analytic Functions with Analytic Machines (Q3576057) (← links)
- (Q4583885) (← links)
- Characterization of sets of limit measures of a cellular automaton iterated on a random configuration (Q4643257) (← links)
- Revising Type-2 Computation and Degrees of Discontinuity (Q4921445) (← links)