Computable Complexity Estimates for Finite Binary Strings

Version 1.0.0.0 (140 KB) von Theophanes Raptis
Experimental attempt to overcome problems with Shannon's entropy and other complexity measures.
0.0
(0)
314 Downloads
Aktualisiert 6. Aug 2013

Lizenz anzeigen

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

Zitieren als

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

Kompatibilität der MATLAB-Version
Erstellt mit R14
Kompatibel mit allen Versionen
Plattform-Kompatibilität
Windows macOS Linux
Kategorien
Mehr zu Physics finden Sie in Help Center und MATLAB Answers

Community Treasure Hunt

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

Start Hunting!

Version Veröffentlicht Versionshinweise
1.0.0.0