Hinton, McClelland & Rumelhart, Distributed Representations, PDP vol. 1 ch. 3, 1986 · pp. 88–91, fig. 2
The Binding Problem
Which x goes with which y, and what it costs to know
X and Y channels
a unit per cell
overlapping conjunctive
1 dot
2 dots
snap to bins
where the code allows a dot
Play random pairs
Swap x
Swap y
units C
radius
New fields
The plane
drag dot A and dot B
A response unit R
fire for A or B alone, not for a ghost alone
Over many pairs of dots
Run again
Units needed in k dimensions
8 positions per axis