Computable model discovery and high-level-programming approximations to algorithmic complexity

DOI10.1016/J.TCS.2022.05.026OpenAlexW4282033653WikidataQ114129100 ScholiaQ114129100MaRDI QIDQ2163372

Vladimir Lemus, Víctor Zamora, Francisco Hernández-Quiroz, Eduardo Acuña-Yeomans, Hector Zenil

Publication date: 10 August 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

IMPalgorithmic information theoryalgorithmic randomnessKolmogorov-chaitin complexitygenerative model generation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• Haskell
• OACC
• acss

Cites Work

• Unnamed Item
• Unnamed Item
• Most programs stop quickly or never halt
• Clustering by Compression
• A Theory of Program Size Formally Identical to Information Theory
• A probabilistic anytime algorithm for the halting problem
• A statistical anytime algorithm for the Halting Problem
• Probability Inequalities for Sums of Bounded Random Variables
• Fundamentals of Computation Theory
• On Computable Numbers, with an Application to the Entscheidungsproblem
• An introduction to Kolmogorov complexity and its applications
• Sloane’s Gap: Do Mathematical and Social Factors Explain the Distribution of Numbers in the OEIS?

This page was built for publication: Computable model discovery and high-level-programming approximations to algorithmic complexity