Pages that link to "Item:Q3021972"
From MaRDI portal
The following pages link to HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT (Q3021972):
Displaying 12 items.
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- On generalized computable universal priors and their convergence (Q860822) (← links)
- Algorithmic complexity bounds on future prediction errors (Q865627) (← links)
- Open problems in universal induction \& intelligence (Q1662486) (← links)
- A complete theory of everything (will be subjective) (Q1662561) (← links)
- On semimeasures predicting Martin-Löf random sequences (Q2381581) (← links)
- On universal prediction and Bayesian confirmation (Q2382281) (← links)
- Algorithmic complexity as a criterion of unsolvability (Q2383595) (← links)
- A coding theorem for enumerable output machines (Q2390302) (← links)
- Sequential predictions based on algorithmic complexity (Q2581758) (← links)
- A Note on Blum Static Complexity Measures (Q2891303) (← links)
- Revising Type-2 Computation and Degrees of Discontinuity (Q4921445) (← links)
