Learn R Programming

acss (version 0.2-5)

Algorithmic Complexity for Short Strings

Description

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 acss.data, 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.

Copy Link

Version

Install

install.packages('acss')

Monthly Downloads

358

Version

0.2-5

License

GPL (>= 2)

Maintainer

Last Published

November 25th, 2014

Functions in acss (0.2-5)

entropy

Standard measures of complexity for strings
normalize_string

Helper functions for calculating cognitive complexity.
matthews2013

Data from Experiment 1 in Matthews (2013)
acss

ACSS complexity
exp2

Data from Experiment 2 in Gauvrit, Singmann, Soler-Toscano & Zenil
exp1

Data from Experiment 1 in Gauvrit, Singmann, Soler-Toscano & Zenil