Buscar
Mostrando ítems 1-2 de 2
Artículo
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
(PeerJ, 2015)
We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating n-dimensional complexity by using an n-dimensional ...
Artículo
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
(IOS Press, 2013)
We show that real-value approximations of Kolmogorov-Chaitin complexity K(s) using the algorithmic coding theorem, as calculated from the output frequency of a large set of small deterministic Turing machines with up to 5 ...