Glossary:Computational spaced repetition: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
;<span id="Computational_spaced_repetition">computational spaced repetition</span> | ;<span id="Computational_spaced_repetition">computational spaced repetition</span> | ||
:approach to [[Glossary:Spaced_repetition|spaced repetition]] in which [[Glossary:Optimum_interval|optimum intervals]] are calculated with the help of a computer on the basis of the past record of learning. [[Glossary:SuperMemo|SuperMemo]] was the first computer program to implement rudimentary spaced repetition algorithm in [http://super-memory.com/articles/soft/sms.htm 1987] | :approach to [[Glossary:Spaced_repetition|spaced repetition]] in which [[Glossary:Optimum_interval|optimum intervals]] are calculated with the help of a computer on the basis of the past record of learning. [[Glossary:SuperMemo|SuperMemo]] was the first computer program to implement rudimentary spaced repetition algorithm in [http://super-memory.com/articles/soft/sms.htm 1987]. Currently, SuperMemo employs the [[Glossary:DSR_model DSR model of memory]] to predict when items are likely to be forgotten | ||
Revision as of 12:55, 22 December 2016
- computational spaced repetition
- approach to spaced repetition in which optimum intervals are calculated with the help of a computer on the basis of the past record of learning. SuperMemo was the first computer program to implement rudimentary spaced repetition algorithm in 1987. Currently, SuperMemo employs the Glossary:DSR_model DSR model of memory to predict when items are likely to be forgotten