Sparse Distributed Memory is a computational algorithm created by Pentti Kanerva used for storing and retrieving large amounts of information without being focused on accuracy of the information. It uses patterns to serve as memory addresses, where information is retrieved based on similarities between addresses. Although each memory address in a list may not be related to another, they are retrieved based on similar content between themselves.
Creator
Pentti Kanerva
Example
Sparse Distributed Memory is based off of pulling in patterns between different addresses.
Imagine each line as a different memory address, an example from Manerva's book:
- "Why are fire engines painted red?
- Firemen's suspenders are red, too.
- Two and two are four.
- Four times three is twelve.
- Twelve inches in a foot.
- A foot is a ruler.
- Queen Mary is a ruler.
- Queen Mary sailed the sea.
- The sea has sharks.
- Sharks have fins.
- The Russians conquered the Finns.
- The Russians' color is red.
- Fire engines are always rushin'.
- So that's why they're painted red!"[1]
Definition
Uses
- ^ Kanerva, Pentti (1988). Sparse Distributed Memory. The MIT Press. ISBN 978-0262111324.