Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics)
From MaRDI portal
Publication:6153527
DOI10.1137/S0040585X97T991647WikidataQ128317481 ScholiaQ128317481MaRDI QIDQ6153527FDOQ6153527
Authors:
Publication date: 14 February 2024
Published in: Theory of Probability & Its Applications (Search for Journal in Brave)
Kolmogorov complexityalgorithmic statisticsresource-bounded complexity\((\alpha, \beta)\)-stochasticityKolmogorov's structure function
Game theory, economics, finance, and other social and behavioral sciences (91-XX) Computer science (68-XX)
Cites Work
- Title not available (Why is that?)
- Algorithmic randomness and complexity.
- A formal theory of inductive inference. Part I
- Modeling by shortest data description
- An almost machine-independent theory of program-length complexity, sophistication, and induction
- Combinatorial foundations of information theory and the calculus of probabilities
- A formal theory of inductive inference. Part II
- An Information Measure for Classification
- Probability and finance. It's only a game!
- Kolmogorov's Structure Functions and Model Selection
- Title not available (Why is that?)
- Algorithmic statistics
- Kolmogorov Complexity and Algorithmic Randomness
- Discussion on Kolmogorov Complexity and Statistical Analysis
- Logical basis for information theory and probability theory
- Three approaches to the quantitative definition of information*
- On the relation between descriptional complexity and algorithmic probability
- Title not available (Why is that?)
- Minimum description length induction, Bayesianism, and Kolmogorov complexity
- Symmetry of information and one-way functions
- Title not available (Why is that?)
- Meaningful Information
- Sophistication revisited
- Computational depth: Concept and applications
- Inductive reasoning and Kolmogorov complexity
- Algorithmic statistics revisited
- Title not available (Why is that?)
- On the Defect of Randomness of a Finite Object with Respect to Measures with Given Complexity Bounds
- Title not available (Why is that?)
- Sophistication vs logical depth
- Kolmogorov's contributions to information theory and algorithmic complexity
- Minimum Message Length and Kolmogorov Complexity
- Algorithmic Information Theory
- On tables of random numbers
- Some Properties of Kolmogorov $\Delta$-Random Finite Sequences
- Title not available (Why is that?)
- Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences
- Algorithms and Randomness
- Title not available (Why is that?)
- Probability theory and mathematical statistics. Proceedings of the Fourth USSR - Japan Symposium, held at Tbilisi, USSR, August 23-29, 1982
- Nonstochastic estimates
- Applying MDL to learn best model granularity
- Algorithmic statistics: forty years later
This page was built for publication: Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153527)