Probability and program-size for functions
From MaRDI portal
Publication:5482595
zbMATH Open1096.68072MaRDI QIDQ5482595FDOQ5482595
Authors: Gregory J. Chaitin 
Publication date: 28 August 2006
Recommendations
- Kolmogorov complexity of enumerating finite sets
- scientific article; zbMATH DE number 1222608
- Comparison between the complexity of a function and the complexity of its graph
- Information, randomness and incompleteness. Papers on algorithmic information theory
- A relation between correctness and randomness in the computation of probabilistic algorithms
This page was built for publication: Probability and program-size for functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5482595)
