Simplicity Theory
|
by Jean-Louis Dessalles
(created
2008.12.31)
(updated 2010.02.18)
Records are unexpected because they are simple in their class

(from flickr.com)
His size (2,72m) made him well-known in the
By definition, unexpectedness is the difference
between generation complexity and description complexity: Cw – C. Let’s compute both
terms.
Suppose you consider the
extreme person, object or situation b as member of a reference class r. In
Cw(b|r)
= log2 N
where N
is the number of elements in class r.
This is because the "world-machine" needs
log2 N bits to
discriminate among all elements in r
which one it will present to you (for details, see the Inverted
Stamp example).
The feature f may be used as the best way to
discriminate b in class r. Therefore:
C(b|r) = C(f) + C(b|r&f)
If b is thought to be unique in its kind, then C(b|r&f) = 0. We get:
U(b|r) = log2 N – C(f)
Finally, if r is not itself unexpected (i.e. Cw(r) = C(r)):
U(b) = log2 N – C(f)
– C(r)
The corrective term C(f) accounts for the fact that records must
be kept as simple as possible for unexpectedness to remain meaningful. Some
recorded achievements are borderline in this respect:
“Fastest speed while swapping places on a motorcycle”, recorded on the 2003
edition of the British edition of the
Dessalles, J-L. (2007). Spontaneous
assessment of complexity in the selection of events. Technical Report ParisTech-ENST
2007D011.
Dessalles, J-L.
(2007). Complexité
cognitive appliquée à la modélisation de l'intérêt narratif. Intellectica, 45 (1), 145-165.
Dessalles, J-L.
(2008). La pertinence et ses origines cognitives -
Nouvelles théories. Paris: Hermes-Science
Publications (in Press).
![]()
Back to the Simplicity Theory page