ListarArtículos (Filosofía y Lógica y Filosofía de la Ciencia) por materia "Small Turing machines"
Mostrando ítems 1-2 de 2
-
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 ...
-
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 ...