SuperMemo Algorithm: Difference between revisions
Jump to navigation
Jump to search
m Replaced content with "Go to [https://supermemo.guru/wiki/SuperMemo_Algorithm SuperMemo Algorithm]" |
No edit summary |
||
| Line 1: | Line 1: | ||
SuperMemo had a fertile impact on the research of modeling long-term memory. One of the most interesting fruits of that research is the [http://www.super-memory.com/english/2vm.htm two component model of long-term memory]. Over the last two decades, it has been hinted on many occasions that the model may provide a sound theoretical basis for a better and more universal approach to [[Glossary:Spaced_repetition|spaced repetition]]. Algorithm SM-18 is the most up-to-date implementation of the theory in a practical application. Due to its universal nature, the algorithm should, in the future, find its way to all SuperMemo products. | |||
For details see: [https://supermemo.guru/wiki/Algorithm_SM-18 Algorithm SM-18] | |||
Revision as of 13:09, 6 March 2019
SuperMemo had a fertile impact on the research of modeling long-term memory. One of the most interesting fruits of that research is the two component model of long-term memory. Over the last two decades, it has been hinted on many occasions that the model may provide a sound theoretical basis for a better and more universal approach to spaced repetition. Algorithm SM-18 is the most up-to-date implementation of the theory in a practical application. Due to its universal nature, the algorithm should, in the future, find its way to all SuperMemo products.
For details see: Algorithm SM-18