See http://complexitycalculator.com/methodology.html for more information or references below.

This dataset shouldn't be called directly but rather through the accessor functions in package acss.

`acss_data`

`K.2`

- acss with 2 symbols, computed on all possible Turing machines (TM) with 5 states and 2 symbols.
`K.4`

- acss with 4 symbols, computed on a large number of TMs with 4 states and 4 symbols.
`K.5`

- acss with 5 symbols, computed on a large number of TMs with 4 states and 5 symbols.
`K.6`

- acss with 6 symbols, computed on a large number of TMs with 4 states and 6 symbols.
`K.9`

- acss with 9 symbols, computed on a large number of TMs with 4 states and 9 symbols.

Gauvrit, N., Zenil, H., Delahaye, J.-P., & Soler-Toscano, F. (2014). Algorithmic complexity for short binary strings applied to psychology: a primer. *Behavior Research Methods*. doi:10.3758/s13428-013-0416-0

Soler-Toscano, F., Zenil, H., Delahaye, J.-P., & Gauvrit, N. (2012). *Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines*. arXiv:1211.1302 [cs.it].