acss: Algorithmic Complexity for Short Strings
Version 0.2-5

Main functionality is to provide the algorithmic complexity for short strings, an approximation of the Kolmogorov Complexity of a short string using the coding theorem method (see ?acss). The database containing the complexity is provided in the data only package, this package provides functions accessing the data such as prob_random returning the posterior probability that a given string was produced by a random process. In addition, two traditional (but problematic) measures of complexity are also provided: entropy and change complexity.

Getting started

Package details

AuthorNicolas Gauvrit [aut], Henrik Singmann [aut, cre], Fernando Soler Toscano [ctb], Hector Zenil [ctb]
Date of publication2014-11-25 08:45:18
MaintainerHenrik Singmann <>
LicenseGPL (>= 2)
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the acss package in your browser

Any scripts or data that you put into this service are public.

acss documentation built on May 29, 2017, 10:40 a.m.