HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
From MaRDI portal
Publication:3021972
Recommendations
- scientific article; zbMATH DE number 17560
- scientific article; zbMATH DE number 4208066
- scientific article; zbMATH DE number 3974293
- Kolmogorov complexity and Hausdorff dimension
- Kolmogorov complexity and computably enumerable sets
- Kolmogorov characterizations of complexity classes
- scientific article; zbMATH DE number 5158938
- Estimates of Kolmogorov complexity in approximating Cantor sets
- On approximate uncomputability of the Kolmogorov complexity function
- Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets
Cites work
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- A Mathematical Theory of Communication
- A Method for the Construction of Minimum-Redundancy Codes
- A formal theory of inductive inference. Part I
- Complexity-based induction systems: Comparisons and convergence theorems
- Limiting recursion
- New error bounds for Solomonoff prediction
- Non-stochastic infinite and finite sequences
- Occam's razor
- On relative randomness
- On the Length of Programs for Computing Finite Binary Sequences
- On the relation between descriptional complexity and algorithmic probability
- Process complexity and effective random tests
- Quantum information and computation
- The definition of random sequences
- Trial and error predicates and the solution to a problem of Mostowski
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Cited in
(20)- Stationary algorithmic probability
- Algorithmic complexity as a criterion of unsolvability
- A computable measure of algorithmic probability by finite approximations with an application to integer sequences
- Correspondence and independence of numerical evaluations of algorithmic information measures
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts
- An extension of Chaitin's halting probability Ω to a measurement operator in an infinite dimensional quantum system
- scientific article; zbMATH DE number 3999902 (Why is no real title available?)
- On universal prediction and Bayesian confirmation
- A complete theory of everything (will be subjective)
- Open problems in universal induction \& intelligence
- On generalized computable universal priors and their convergence
- Kolmogorov complexity for possibly infinite computations
- On semimeasures predicting Martin-Löf random sequences
- Algorithmic complexity bounds on future prediction errors
- Revising type-2 computation and degrees of discontinuity
- Sequential predictions based on algorithmic complexity
- A coding theorem for enumerable output machines
- Occam bound on lowest complexity of elements
- A note on Blum static complexity measures
This page was built for publication: HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3021972)
