Repositorio de producción científica de la Universidad de Sevilla

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

 

Advanced Search
 
Opened Access A decomposition method for global evaluation of Shannon entropy and local estimations of algorithmic complexity
Cites

Show item statistics
Icon
Export to
Author: Zenil, Hector
Hernández Orozco, Santiago
Kiani, Narsis
Soler Toscano, Fernando
Rueda Toicen, Antonio
Tegnér, Jesper
Department: Universidad de Sevilla. Departamento de Filosofía y Lógica y Filosofía de la Ciencia
Date: 2018
Published in: Entropy, 20 (8)
Document type: Article
Abstract: 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...
[See more]
Cite: Zenil, H., Hernández Orozco, S., Kiani, N., Soler Toscano, F., Rueda Toicen, A. y Tegnér, J. (2018). A decomposition method for global evaluation of Shannon entropy and local estimations of algorithmic complexity. Entropy, 20 (8)
Size: 2.005Mb
Format: PDF

URI: https://hdl.handle.net/11441/78763

DOI: 10.3390/e20080605

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)