From algorithmic to subjective randomness

Thomas L. Griffiths; Joshua B. Tenenbaum

From algorithmic to subjective randomness

Thomas L. Griffiths, Joshua B. Tenenbaum

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness perception based on the statistical problem of model selection: given a stimulus, inferring whether the process that generated it was random or regular. Inspired by the mathematical definition of randomness given by Kolmogorov complexity, we characterize regularity in terms of a hierarchy of automata that augment a finite controller with different forms of memory. We find that the regularities detected in binary sequences depend upon presentation format, and that the kinds of automata that can identify these regularities are informative about the cognitive processes engaged by different formats.

Original language	English (US)
Title of host publication	Advances in Neural Information Processing Systems 16 - Proceedings of the 2003 Conference, NIPS 2003
Publisher	Neural information processing systems foundation
ISBN (Print)	0262201526, 9780262201520
State	Published - Jan 1 2004
Externally published	Yes
Event	17th Annual Conference on Neural Information Processing Systems, NIPS 2003 - Vancouver, BC, Canada Duration: Dec 8 2003 → Dec 13 2003

Other

Other	17th Annual Conference on Neural Information Processing Systems, NIPS 2003
Country/Territory	Canada
City	Vancouver, BC
Period	12/8/03 → 12/13/03

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Information Systems
Signal Processing

Cite this

@inproceedings{0b49e914a0be4c2a96db3d834a7ec1ea,

title = "From algorithmic to subjective randomness",

abstract = "We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness perception based on the statistical problem of model selection: given a stimulus, inferring whether the process that generated it was random or regular. Inspired by the mathematical definition of randomness given by Kolmogorov complexity, we characterize regularity in terms of a hierarchy of automata that augment a finite controller with different forms of memory. We find that the regularities detected in binary sequences depend upon presentation format, and that the kinds of automata that can identify these regularities are informative about the cognitive processes engaged by different formats.",

author = "Griffiths, {Thomas L.} and Tenenbaum, {Joshua B.}",

year = "2004",

month = jan,

day = "1",

language = "English (US)",

isbn = "0262201526",

booktitle = "Advances in Neural Information Processing Systems 16 - Proceedings of the 2003 Conference, NIPS 2003",

publisher = "Neural information processing systems foundation",

note = "17th Annual Conference on Neural Information Processing Systems, NIPS 2003 ; Conference date: 08-12-2003 Through 13-12-2003",

}

TY - GEN

T1 - From algorithmic to subjective randomness

AU - Griffiths, Thomas L.

AU - Tenenbaum, Joshua B.

PY - 2004/1/1

Y1 - 2004/1/1

N2 - We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness perception based on the statistical problem of model selection: given a stimulus, inferring whether the process that generated it was random or regular. Inspired by the mathematical definition of randomness given by Kolmogorov complexity, we characterize regularity in terms of a hierarchy of automata that augment a finite controller with different forms of memory. We find that the regularities detected in binary sequences depend upon presentation format, and that the kinds of automata that can identify these regularities are informative about the cognitive processes engaged by different formats.

AB - We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness perception based on the statistical problem of model selection: given a stimulus, inferring whether the process that generated it was random or regular. Inspired by the mathematical definition of randomness given by Kolmogorov complexity, we characterize regularity in terms of a hierarchy of automata that augment a finite controller with different forms of memory. We find that the regularities detected in binary sequences depend upon presentation format, and that the kinds of automata that can identify these regularities are informative about the cognitive processes engaged by different formats.

UR - http://www.scopus.com/inward/record.url?scp=33745779505&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745779505&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33745779505

SN - 0262201526

SN - 9780262201520

BT - Advances in Neural Information Processing Systems 16 - Proceedings of the 2003 Conference, NIPS 2003

PB - Neural information processing systems foundation

T2 - 17th Annual Conference on Neural Information Processing Systems, NIPS 2003

Y2 - 8 December 2003 through 13 December 2003

ER -

From algorithmic to subjective randomness

Abstract

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this