algorithmic information theory

E774596
branch of mathematics branch of theoretical computer science research field

Algorithmic information theory is a branch of theoretical computer science and mathematics that studies the complexity and information content of objects using concepts like Kolmogorov complexity and randomness.

Try in SPARQL Jump to: Statements Referenced by

Statements (69)

Predicate Object
instanceOf branch of mathematics ⓘ
branch of theoretical computer science ⓘ
research field ⓘ
appliedIn cryptography ⓘ
data compression ⓘ
foundations of probability ⓘ
foundations of statistics ⓘ
machine learning theory ⓘ
philosophy of mathematics ⓘ
theoretical computer science ⓘ
basedOnConcept Turing machines NERFINISHED ⓘ
computability theory ⓘ
information theory ⓘ
measure theory ⓘ
probability theory ⓘ
fieldOfStudy Chaitin’s Omega NERFINISHED ⓘ
Kolmogorov complexity NERFINISHED ⓘ
algorithmic probability ⓘ
algorithmic randomness ⓘ
conditional Kolmogorov complexity NERFINISHED ⓘ
descriptional complexity ⓘ
effective dimension ⓘ
formal notions of randomness ⓘ
incompressibility method ⓘ
information content of finite objects ⓘ
minimum description length principle NERFINISHED ⓘ
mutual information between strings ⓘ
plain Kolmogorov complexity NERFINISHED ⓘ
prefix codes ⓘ
prefix-free complexity ⓘ
universal Turing machines NERFINISHED ⓘ
universal distributions ⓘ
hasKeyConcept Chaitin’s incompleteness theorem NERFINISHED ⓘ
Hausdorff dimension of sequences ⓘ
Kolmogorov complexity NERFINISHED ⓘ
Levin complexity NERFINISHED ⓘ
Martin-Löf randomness NERFINISHED ⓘ
Solomonoff induction NERFINISHED ⓘ
algorithmic randomness ⓘ
effective null sets ⓘ
incompressible strings ⓘ
monotone complexity ⓘ
mutual information of finite objects ⓘ
plain Kolmogorov complexity NERFINISHED ⓘ
prefix Kolmogorov complexity NERFINISHED ⓘ
prefix-free machines ⓘ
random sequences ⓘ
self-delimiting programs ⓘ
universal semimeasure ⓘ
hasPioneer Andrey Kolmogorov NERFINISHED ⓘ
Gregory Chaitin NERFINISHED ⓘ
Per Martin-Löf NERFINISHED ⓘ
Ray Solomonoff NERFINISHED ⓘ
hasProperty connects randomness with incompressibility ⓘ
defines information via shortest effective description ⓘ
provides machine-independent complexity up to additive constant ⓘ
uses programs as descriptions of objects ⓘ
yields incompleteness results for formal systems ⓘ
relatedTo Shannon information theory NERFINISHED ⓘ
complexity theory ⓘ
computability theory ⓘ
mathematical logic ⓘ
probability theory ⓘ
studies complexity of finite strings ⓘ
formal definitions of randomness ⓘ
information content of objects ⓘ
limits of data compression ⓘ
randomness of infinite sequences ⓘ
relationships between computation and information ⓘ

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.

Universal Intelligence: A Definition of Machine Intelligence → field → algorithmic information theory ⓘ
Universal Intelligence: A Definition of Machine Intelligence → influencedBy → algorithmic information theory ⓘ