Algorithmic Complexity for Short Binary Strings Applied to Psychology: A Primer
Computational Complexity
2013-12-10 v3
Abstract
Since human randomness production has been studied and widely used to assess executive functions (especially inhibition), many measures have been suggested to assess the degree to which a sequence is random-like. However, each of them focuses on one feature of randomness, leading authors to have to use multiple measures. Here we describe and advocate for the use of the accepted universal measure for randomness based on algorithmic complexity, by means of a novel previously presented technique using the the definition of algorithmic probability. A re-analysis of the classical Radio Zenith data in the light of the proposed measure and methodology is provided as a study case of an application.
Cite
@article{arxiv.1106.3059,
title = {Algorithmic Complexity for Short Binary Strings Applied to Psychology: A Primer},
author = {Nicolas Gauvrit and Hector Zenil and Jean-Paul Delahaye and Fernando Soler-Toscano},
journal= {arXiv preprint arXiv:1106.3059},
year = {2013}
}
Comments
To appear in Behavior Research Methods