Probability, algorithmic complexity, and subjective randomness
Thomas L. Griffiths, Joshua B. Tenenbaum · eScholarship (California Digital Library) · 2003
We present a statistical account of human randomness judgments that uses the idea of algorithmic complexity. We show that an existing measure of the randomness of a sequence corresponds to the assumption that non-random sequences are generated by a particular probabilistic finite state automaton, and use this as the basis for an account that evaluates randomness in terms of the length of programs for machines at di#erent levels of the Chomsky hierarchy.