Buscar
Mostrando ítems 1-2 de 2
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
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 ...