Computable Complexity Estimates for Finite Binary Strings

Experimental attempt to overcome problems with Shannon's entropy and other complexity measures.

Al momento, stai seguendo questo contributo

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 (2026). 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 .

Categorie

Scopri di più su Physics in Help Center e MATLAB Answers

Informazioni generali

Compatibilità della release di MATLAB

  • Compatibile con qualsiasi release

Compatibilità della piattaforma

  • Windows
  • macOS
  • Linux
Versione Pubblicato Note della release Action
1.0.0.0