Abstract

Much research has linked surprise to violation of expectations, but it has been less clear how one can be surprised when one has no particular expectation. This paper discusses a computational theory based on Algorithmic Information Theory, which can account for surprises in which one initially expects randomness but then notices a pattern in stimuli. The authors present evidence that a “randomness deficiency” heuristic leads to surprise in such cases.