HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
DOI10.1142/S0129054102001291zbMATH Open1066.68058OpenAlexW2030492659WikidataQ55870889 ScholiaQ55870889MaRDI QIDQ3021972FDOQ3021972
Authors: Jürgen Schmidhuber 
Publication date: 22 June 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054102001291
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
computability in the limitcomputable universescumulatively enumerable measuresgeneralized algorithmic probabilitygeneralized Kolmogorov complexity hierarchyhalting probability Omega
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Turing machines and related notions (03D10) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- A Mathematical Theory of Communication
- Title not available (Why is that?)
- On the Length of Programs for Computing Finite Binary Sequences
- A formal theory of inductive inference. Part I
- Process complexity and effective random tests
- Quantum information and computation
- The definition of random sequences
- On the relation between descriptional complexity and algorithmic probability
- A Method for the Construction of Minimum-Redundancy Codes
- Occam's razor
- Trial and error predicates and the solution to a problem of Mostowski
- Complexity-based induction systems: Comparisons and convergence theorems
- Limiting recursion
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
- On relative randomness
- Non-stochastic infinite and finite sequences
- New error bounds for Solomonoff prediction
Cited In (20)
- Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts
- Kolmogorov complexity for possibly infinite computations
- Algorithmic complexity bounds on future prediction errors
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Occam bound on lowest complexity of elements
- A complete theory of everything (will be subjective)
- Open problems in universal induction \& intelligence
- On generalized computable universal priors and their convergence
- Revising type-2 computation and degrees of discontinuity
- On semimeasures predicting Martin-Löf random sequences
- A note on Blum static complexity measures
- On universal prediction and Bayesian confirmation
- Algorithmic complexity as a criterion of unsolvability
- A coding theorem for enumerable output machines
- Sequential predictions based on algorithmic complexity
- Stationary algorithmic probability
- A computable measure of algorithmic probability by finite approximations with an application to integer sequences
- An extension of Chaitin's halting probability Ω to a measurement operator in an infinite dimensional quantum system
- Correspondence and independence of numerical evaluations of algorithmic information measures
- Title not available (Why is that?)
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)
