Mnemonic search

What is the best way of memorizing something some information x?

For computers, this is the compression problem. We have the usual trade-off between space and time. At one extreme (ignoring time), the space occupied is the Kolmogorov Complexity of x (relative to the computer, and the memories it already has), written KC(x).

If humans are just a different kind of machine, the optimal encoding's length will be the KC relative to this machine. Can we make such a machine from ACT-R?

Since KC is incomputable, computable approximations are found through a universal program search: what is the shortest program we can find whose output is x? The analogous question for humans is: what is the simplest way of presenting this information?

If we do a "cognitive TM search", won't the output be a near-optimal tutoring program? Maybe not: unlike the case with computers, tutors need to worry about retention.


I have a more ambitious dream of automatically creating a tutor from a formal theory. One way is to encode these formal theories as ordinary memories.


formalizing my analogy (this needs to be refined):
human memory <-> computer memory
compressed data <-> axioms of the theory

Of course, people aren't meant to learn theories only as formal systems. They need to use them concretely too.


See Phil Pavlik's work on optimizing of memorization schedules.