A decomposition method for global evaluation of shannon entropy and local estimations of algorithmic complexity

A decomposition method for global evaluation of shannon entropy and local estimations of algorithmic complexity

We investigate the properties of a divide-and-conquer Block Decomposition Method (BDM), which extends the power of a Coding Theorem Method (CTM) that approximates local estimations of algorithmic complexity and of logical depth based upon Solomonoff-Levin's theory of algorithmic probability, th...

Full description

Bibliographic Details
Main Authors:	Zenil, H, Soler-Toscano, F, Kiani, N, Hernández-Orozco, S, Rueda-Toicen, A
Format:	Journal article
Published:	2016

Similar Items

Low algorithmic complexity entropy-deceiving graphs
by: Zenil, H, et al.
Published: (2017)

Notes on the Shannon Entropy of the Neural Response
by: Shakhnarovich, Greg, et al.
Published: (2009)

Consistency of the Shannon entropy in quantum experiments
by: Mana, P
Published: (2003)

Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution
by: Abrahão, FS, et al.
Published: (2024)

An alternate unsupervised technique based on distance correlation and shannon entropy to estimate λ⁰ -fuzzy measure
by: Anath Rau Krishnan, et al.
Published: (2020)

Two-sided exponential concentration bounds for Bayes error rate and Shannon entropy
by: Honorio, Jean, et al.
Published: (2015)

Investigation of improved methods for assessing convergence of models in MCNP using Shannon entropy
by: Macdonald, Ruaridh (Ruaridh R.)
Published: (2013)

Algorithmic complexity for short binary strings applied to psychology: a primer
by: Gauvrit, N, et al.
Published: (2013)

Algorithmic complexity for psychology: A user−friendly implementation of the coding theorem method
by: Gauvrit, N, et al.
Published: (2015)

Algorithmic complexity of motifs clusters superfamilies of networks
by: Zenil, H, et al.
Published: (2013)

Shannon's theorem revisited
by: Ekert, A
Published: (1994)

Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
by: Soler−Toscano, F, et al.
Published: (2013)

Correlation of automorphism group size and topological properties with program−size complexity evaluations of graphs and complex networks
by: Zenil, H, et al.
Published: (2014)

Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
by: Zenil, H, et al.
Published: (2014)

Natural Scene Statistics Mediate the Perception of Image Complexity
by: Gauvrit, N, et al.
Published: (2014)

Fractal Dimension of Space−time Diagrams and the Runtime Complexity of Small Turing Machines
by: Joosten, J, et al.
Published: (2013)

Letter to Mr P Shannon
by: Anti-Partition League, APL
Published: (1939)

Letter to Mr Pierce Shannon
by: Anti-Partition League, APL
Published: (1939)

On the normalized Shannon capacity of a union
by: Keevash, P, et al.
Published: (2016)

QUANTUM COMPUTING - SHANNON THEOREM REVISITED
by: Ekert, A
Published: (1994)

A second-quantised Shannon theory
by: Kristjánsson, H
Published: (2022)

Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines
by: Soler−Toscano, F, et al.
Published: (2014)

Urban expansion assessment by using remotely sensed data and the relative Shannon entropy model in GIS: a case study of Tripoli, Libya
by: A. A. Al Sharif, Abubakr, et al.
Published: (2015)

Letter from P Shannon to Mr Barry-Walsh
by: Shannon, P., et al.
Published: (1939)

The essential message : Claude Shannon and the making of information theory
by: Guizzo, Erico Marui
Published: (2007)

High-Throughput Computation of Shannon Mutual Information on Chip
by: Zhi Xuan Li, Peter, et al.
Published: (2021)

Sparsity of Non−trivial Proving Speed−up in Random Systems of Propositional Calculus
by: Hernandez−Orozco, S, et al.
Published: (2013)

The limits of decidable states on open-ended evolution and emergence
by: Hernández-Orozco, S, et al.
Published: (2016)

Empirical Encounters with Computational Irreducibility and Unpredictability
by: Zenil, H, et al.
Published: (2012)

Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness
by: Delahaye, J, et al.
Published: (2012)

Edge-preserving Multiscale Image Decomposition based on Local Extrema
by: Subr, Kartic, et al.
Published: (2012)

Algorithmic Complexity of Financial Motions
by: Ma, L, et al.
Published: (2014)

The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels
by: Bennett, Charles H., et al.
Published: (2015)

FSMI: Fast computation of Shannon mutual information for information-theoretic mapping
by: Zhang, Zhengdong, et al.
Published: (2021)

On acoustically modulated jet shear layers and the Nyquist–Shannon sampling theorem
by: Nicholls, CJ, et al.
Published: (2022)

Bounding quantum correlations: the role of the Shannon information in the Information Causality principle
by: Oughton, N, et al.
Published: (2024)

Program−size versus Time complexity‚ Slowdown and speed−up phenomena in the micro−cosmos of small Turing machines
by: Soler−Toscano, H
Published: (2010)

A decomposition algorithm for local access telecommunications network expansion planning
Published: (2004)

A decomposition algorithm for local access telecommunications network expansion planning
Published: (2003)

An Improved RDWT-based Image Steganography Scheme with QR Decomposition and Double Entropy
by: Ng, Ke-Huey, et al.
Published: (2020)