Data for algorithmic complexity of short strings
This is a data only package providing the algorithmic complexity of short strings, computed using the coding theorem method. For a given set of symbols in a string, all possible or a large number of random samples of Turing machines with a given number of states (e.g., 5) and number of symbols corresponding to the number of symbols in the strings were simulated until they reached a halting state or failed to end. This package contains data on 4.5 million strings from length 1 to 12 simulated on Turing machines with 2, 4, 5, 6, and 9 symbols. The complexity of the string corresponds to the distribution of the halting states.
System | Target | Derivation | Build status |
---|---|---|---|
x86_64-linux | /gnu/store/m79i1c29jbxbp77bvwh6sj2qk0iinnkk-r-acss-data-1.0.drv | ||
mips64el-linux | /gnu/store/438772p5d8bgyyj16nap0xjvsxqkf4rw-r-acss-data-1.0.drv | ||
i686-linux | /gnu/store/jlfia2zilglan5dn31js9qkbr4w5hwkh-r-acss-data-1.0.drv | ||
i586-gnu | /gnu/store/k0j3mwfc03nz2s50rxqir7ikvyh0swgn-r-acss-data-1.0.drv | ||
armhf-linux | /gnu/store/zrymmlazmgvj66nlp7n5y4rdwck1siyw-r-acss-data-1.0.drv | ||
aarch64-linux | /gnu/store/gi00svhn9j6jihpfkvq0kksvdwa3r4pz-r-acss-data-1.0.drv |
Linter | Message | Location |
---|---|---|
No lint warnings ✓ |