Buscar
Mostrando ítems 1-4 de 4
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 (CTM) that approximates local estimations of algorithmic complexity based on Solomonoff–Levin’s theory ...
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 topological properties of empirical networks, ranging from metabolic to social networks, and of ...
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, and that lossless compression algorithms fall short at characterizing patterns other than statistical ...
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 ...