Computable Complexity Estimates for Finite Binary Strings

Versión 1.0.0.0 (140 KB) por Theophanes Raptis
Experimental attempt to overcome problems with Shannon's entropy and other complexity measures.
0.0
(0)
314 descargas
Actualizado 6 ago 2013

Ver licencia

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

Citar como

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. Recuperado .

Compatibilidad con la versión de MATLAB
Se creó con R14
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux
Categorías
Más información sobre Physics en Help Center y MATLAB Answers.

Community Treasure Hunt

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

Start Hunting!

Versión Publicado Notas de la versión
1.0.0.0