Computable Complexity Estimates for Finite Binary Strings

Versione 1.0.0.0 (140 KB) da Theophanes Raptis
Experimental attempt to overcome problems with Shannon's entropy and other complexity measures.
0.0
(0)
314 download
Aggiornato 6 ago 2013

Visualizza la licenza

This file is also a response to a recent publication by Grenville Croll on Bi-entropies (http://arxiv.org/abs/1305.0954)
It contains a small toolbox that could prove usefull in so called "Bit-String Physics" introduced by H. Pierre Noyes.
Contents:
Guidelines.pdf
testocm.m (main)
getocm.m, clusters.m, derivatives.m, BLLSG.m

Cita come

Theophanes Raptis (2025). Computable Complexity Estimates for Finite Binary Strings (https://it.mathworks.com/matlabcentral/fileexchange/42964-computable-complexity-estimates-for-finite-binary-strings), MATLAB Central File Exchange. Recuperato .

Compatibilità della release di MATLAB
Creato con R14
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Categorie
Scopri di più su Physics in Help Center e MATLAB Answers
Tag Aggiungi tag

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Versione Pubblicato Note della release
1.0.0.0