Computer Science – Computational Complexity
Scientific paper
2011-06-15
Computer Science
Computational Complexity
Scientific paper
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.
Delahaye Jean-Paul
Gauvrit Nicolas
Zenil Hector
No associations
LandOfFree
Assessing Cognitive Randomness: A Kolmogorov Complexity Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Assessing Cognitive Randomness: A Kolmogorov Complexity Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Assessing Cognitive Randomness: A Kolmogorov Complexity Approach will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-659931