Computable Complexity Estimates for Finite Binary Strings
Experimental attempt to overcome problems with Shannon's entropy and other complexity measures.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
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://se.mathworks.com/matlabcentral/fileexchange/42964-computable-complexity-estimates-for-finite-binary-strings), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0.0.0 (140 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 |
