Computable Complexity Estimates for Finite Binary Strings

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

View License

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

Cite As

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

MATLAB Release Compatibility
Created with R14
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Physics in Help Center and MATLAB Answers
Tags Add Tags

Version Published Release Notes
1.0.0.0