ListarFilosofía y Lógica y Filosofía de la Ciencia por materia "Algorithmic probability"
Mostrando ítems 1-4 de 4
-
Artículo
A computable measure of algorithmic probability by finite approximations with an application to integer sequences
(Hindawi/Wiley, 2017)Given the widespread use of lossless compression algorithms to approximate algorithmic (Kolmogorov-Chaitin) complexity, ...
-
Artículo
A decomposition method for global evaluation of Shannon entropy and local estimations of algorithmic complexity
(MDPI, 2018)We investigate the properties of a Block Decomposition Method (BDM), which extends the power of a Coding Theorem Method ...
-
Artículo
Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
(Elsevier, 2014)We show that numerical approximations of Kolmogorov complexity (K) of graphs and networks capture some group-theoretic and ...
-
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 ...