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...
| Main Authors: | , , , , |
|---|---|
| Format: | Journal article |
| Published: |
2016
|