Live briefing
Everything about Algorithmic information theory
Subfield of information theory and computer science
Algorithmic information theory (AIT) is a branch of theoretical computer science that concerns itself with the relationship between computation and information of computably generated objects, such as strings or any other data structure. In other words, it is shown within algorithmic information theory that computational incompressibility "mimics" the relations or inequalities found in information theory. According to Gregory Chaitin, it is "the result of putting Shannon's information theory and Turing's computability theory into a cocktail shaker and shaking vigorously." Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Algorithmic information theoryA 5-minute orientation
- Skim a recent paper: Bridging Algorithmic Information Theory and Machine Learning: A new approach to kernel learningInfluential work since 2022
- Pick up a classic book: Computer NetworksThe most-reprinted book on the subject
- Read the landmark paper: Algorithmic Information TheoryCited 242 times
- Go sideways: Kolmogorov complexityA closely related topic
- Go sideways: Algorithmic probabilityA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Algorithmic Information Theory
Kolmogorov's Contributions to Information Theory and Algorithmic Complexity
An algorithmic information theory of consciousness
Methods of information theory and algorithmic complexity for network biology
Algorithmic information theory
Law without law: from observer states to physics via algorithmic information theory
Blind source separation using algorithmic information theory
Automatic Summarization of Changes in Biological Image Sequences Using Algorithmic Information Theory
🆕 Influential since 2022
Bridging Algorithmic Information Theory and Machine Learning: A new approach to kernel learning
A circuit complexity formulation of algorithmic information theory
Algorithmic Information Theory for the Precise Engineering of Flexible Material Mechanics
What Should I Notice? Using Algorithmic Information Theory to Evaluate the Memorability of Events in Smart Homes
Information Theory in Perception of Form: From Gestalt to Algorithmic Complexity
📚 Books worth reading
Computer NetworksAndrew S. Tanenbaum, John David Wetherall · 1981
Distributed SystemsSukumar Ghosh · 2006
Information Processing and Management of Uncertainty in Knowledge-Based SystemsJoao Paulo Carvalho, Marie-Jeanne Lesot · 2016
The Master AlgorithmPedro Domingos · 2015
The art of error correcting codingRobert H. Morelos-Zaragoza · 2002
The pattern on the stoneW. Daniel Hillis · 1998
Quantum Walks and Search AlgorithmsRenato Portugal · 2013- 📕AlgorithmsSushil C. Dimri, Preeti Malik · 2020
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Kolmogorov complexity In algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is…
- Algorithmic probability In algorithmic information theory, algorithmic probability, also known as Solomonoff probability, is a mathematical method of assigning a prior probability…
- Ray Solomonoff Ray Solomonoff (July 25, 1926 – December 7, 2009) was an American mathematician who invented algorithmic probability, his General Theory of Inductive Inference…
- Solomonoff's theory of inductive inference Solomonoff's theory of inductive inference in philosophy is a method of evaluating scientific models according to their description length. According to…
- Universality probability Universality probability is an abstruse probability measure in computational complexity theory that concerns universal Turing machines. A Turing machine…
- Chaitin's constant In the computer science subfield of algorithmic information theory, a Chaitin constant, Chaitin omega number, or halting probability is a real number that…
- Random sequence The concept of a random sequence is essential in probability theory and statistics. The concept generally relies on the notion of a sequence of random…
- Algorithmically random sequence Intuitively, an algorithmically random sequence (or random sequence) is a sequence of binary digits that appears random to any algorithm running on a (prefix-fr…