On the relation between descriptional complexity and algorithmic probability

Similar Works

Action	Title	Year	Authors
+	On the relation between descriptional complexity and algorithmic probability	1983	Péter Gács
+	Lecture notes on descriptional complexity and randomness	2021	Péter Gács
+	Increasing the gap between descriptional complexity and algorithmic probability	2011	Adam R. Day
+	Algorithmic information theory: Some recollections	2007	Gregory J. Chaitin
+ PDF Chat	A Discrepancy Lower Bound for Information Complexity	2012	Mark Braverman Omri Weinstein
+ PDF Chat	A Discrepancy Lower Bound for Information Complexity	2015	Mark Braverman Omri Weinstein
+	Information complexity and applications	2019	Mark Braverman
+	Algorithmic information, complexity and Zipf's law.	2002	V. K. Balasubrahmanyan S. Naranan
+	SIGACT News Complexity Theory Column 104	2020	Lane A. Hemaspaandra
+ PDF Chat	Algorithmic Statistics: Forty Years Later	2016	Nikolay Vereshchagin Alexander Shen
+	Algorithmic Complexity and Pseudo-Random Sequences	1988	Ivan Kramosil
+	Precise Expression for the Algorithmic Information Distance	2020	Bruno Bauwens
+	An Invitation to Algorithmic Information Theory	1996	Gregory J. Chaitin
+	Algorithmic Information Theory	1993	Alexander Shen
+	On the relation between linear complexity and Kolmogorov complexity	1993	Feng Bao
+	Computational Complexity, Random Sequences, and Probability	1973	Terrence L. Fine
+ PDF Chat	A circuit complexity formulation of algorithmic information theory	2023	Cole Wyeth Carl Sturtivant
+	Lower Bounds via Kolmogorov Complexity	1998	Uwe Schöning Randall Pruim
+	On the de-randomization of space-bounded approximate counting problems	2015	Dean Doron Amnon Ta‐Shma
+	How to Run Algorithmic Information Theory on a Computer	1995	Gregory J. Chaitin

Works That Cite This (2)

Action	Title	Year	Authors
+	Randomness and Computability	2011	Adam R. Day
+	Randomness and Computability	2011	Adam R. Day

Works Cited by This (4)

Action	Title	Year	Authors
+	Logical basis for information theory and probability theory	1968	A. N. Kolmogorov
+	THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS	1970	Alexander K. Zvonkin Leonid A. Levin
+	The definition of random sequences	1966	Per Martin-Löf
+	On Random and Hard-to-Describe Numbers	2007	Charles H. Bennett