A computable measure of algorithmic probability by finite approximations with an application to integer sequences

DOI10.1155/2017/7208216zbMath1380.90207arXiv1504.06240OpenAlexW2727323522MaRDI QIDQ1693803

Hector Zenil, Fernando Soler-Toscano

Publication date: 31 January 2018

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.06240

zbMATH Keywords

algorithmic (Kolmogorov-Chaitin) complexitygeneric lossless compression algorithmsLevin-inspired measure \(m\)output distribution of small Turing machines

Mathematics Subject Classification ID

Stochastic programming (90C15)

Uses Software

• OEIS
• OACC
• acss

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The miraculous universal distribution
• Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
• Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
• The Determination of the Value of Rado's Noncomputable Function | sum(k) for Four-State Turing Machines
• On Non-Computable Functions
• Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
• Three approaches to the quantitative definition of information^*
• On the Length of Programs for Computing Finite Binary Sequences
• A formal theory of inductive inference. Part II

This page was built for publication: A computable measure of algorithmic probability by finite approximations with an application to integer sequences