Computable model discovery and high-level-programming approximations to algorithmic complexity
From MaRDI portal
Recommendations
- Slightly Beyond Turing’s Computability for Studying Genetic Programming
- A computable measure of algorithmic probability by finite approximations with an application to integer sequences
- Algorithmic Probability: Theory and Applications
- scientific article; zbMATH DE number 2040721
- scientific article; zbMATH DE number 2040936
Cites work
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- 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
- An introduction to Kolmogorov complexity and its applications
- Clustering by Compression
- Fundamentals of Computation Theory
- Most programs stop quickly or never halt
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Probability Inequalities for Sums of Bounded Random Variables
- Sloane’s Gap: Do Mathematical and Social Factors Explain the Distribution of Numbers in the OEIS?
Cited in
(2)
This page was built for publication: Computable model discovery and high-level-programming approximations to algorithmic complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163372)
