A circuit complexity formulation of algorithmic information theory
From MaRDI portal
Publication:6090675
DOI10.1016/j.physd.2023.133925arXiv2306.14087OpenAlexW4387026877MaRDI QIDQ6090675
Publication date: 17 November 2023
Published in: Physica D (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2306.14087
algorithmic information theoryBoolean functionsKolmogorov complexitycircuit complexitysequence predictionsolomonoff induction
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A philosophical treatise of universal induction
- Finite state complexity
- Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
- Bayesian learning for neural networks
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization
- Approximating the smallest grammar
- Computational limitations on learning from examples
- A universal algorithm for sequential data compression
- A formal theory of inductive inference. Part I
- An introduction to Kolmogorov complexity and its applications
This page was built for publication: A circuit complexity formulation of algorithmic information theory