Computable Complexity Estimates for Finite Binary Strings

Version 1.0.0.0 (140 ko) par Theophanes Raptis
Experimental attempt to overcome problems with Shannon's entropy and other complexity measures.
0.0
(0)
314 téléchargements
Mise à jour 6 août 2013

Afficher la licence

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

Citation pour cette source

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. Récupéré le .

Compatibilité avec les versions de MATLAB
Créé avec R14
Compatible avec toutes les versions
Plateformes compatibles
Windows macOS Linux
Catégories
En savoir plus sur Physics dans Help Center et MATLAB Answers

Community Treasure Hunt

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

Start Hunting!

Version Publié le Notes de version
1.0.0.0