Format

Send to

Choose Destination
Behav Res Methods. 2014 Sep;46(3):732-44. doi: 10.3758/s13428-013-0416-0.

Algorithmic complexity for short binary strings applied to psychology: a primer.

Author information

1
CHART (PARIS-reasoning), University of Paris VIII and EPHE, Paris, France, ngauvrit@me.com.

Abstract

As human randomness production has come to be more closely studied and used to assess executive functions (especially inhibition), many normative measures for assessing the degree to which a sequence is randomlike have been suggested. However, each of these measures focuses on one feature of randomness, leading researchers to have to use multiple measures. Although algorithmic complexity has been suggested as a means for overcoming this inconvenience, it has never been used, because standard Kolmogorov complexity is inapplicable to short strings (e.g., of length lā€‰ā‰¤ā€‰50), due to both computational and theoretical limitations. Here, we describe a novel technique (the coding theorem method) based on the calculation of a universal distribution, which yields an objective and universal measure of algorithmic complexity for short strings that approximates Kolmogorov-Chaitin complexity.

PMID:
24311059
DOI:
10.3758/s13428-013-0416-0
[Indexed for MEDLINE]

Supplemental Content

Full text links

Icon for Springer
Loading ...
Support Center