Algorithmic Complexity for Short Binary Strings Applied to Psychology: A Primer

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.

To appear in Behavior Research Methods

References in corpus (1)

• Towards a stable definition of Kolmogorov-Chaitin complexity

Cited by in corpus (6)

• Natural scene statistics mediate the perception of image complexity
• Three Perspectives on Complexity $-$ Entropy, Compression, Subsymmetry
• Approximations of Algorithmic and Structural Complexity Validate Cognitive-behavioural Experimental Results
• Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem method
• On the Complexity and Behaviour of Cryptocurrencies Compared to Other Markets
• Slime mould: the fundamental mechanisms of cognition