Algorithm SM-2
(Redirected from SuperMemo 2)
Algorithm SM-2 was the first computer algorithm for computing the optimum schedule in spaced repetition. It was first used in SuperMemo 1.0 for DOS on Dec 13, 1987. It was improved slightly in SuperMemo 2.0 that was released as freeware in 1991. The numbering SM-2 comes from SuperMemo 2. There has never been Algorithm SM-1.
For details see: Algorithm SM-2
This glossary entry is used to explain "History of spaced repetition" by Piotr Wozniak (June 2018)
.jpg)
Figure: SuperMemo 1.0 for DOS (1987) was the first computer application of spaced repetition. It introduced Algorithm SM-2 that remains popular three decades later