A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity

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 of algorithmic probability providing a closer connection to algorithmic compl...

Descripción completa

Detalles Bibliográficos
Autores principales: Zenil, Hector, Hernández-Orozco, Santiago, Kiani, Narsis A., Soler-Toscano, Fernando, Rueda-Toicen, Antonio, Tegnér, Jesper
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2018
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7513128/
https://www.ncbi.nlm.nih.gov/pubmed/33265694
http://dx.doi.org/10.3390/e20080605

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7513128/
https://www.ncbi.nlm.nih.gov/pubmed/33265694
http://dx.doi.org/10.3390/e20080605

Ejemplares similares