Sparse distributed memory

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. Whether the addresses may or may not be related, they have a similar pattern, so they were retrieved.

Creator

Pentti Kanerva

Example

Sparse Distributed Memory is based off of patterns, (fire trucks red)(red is a color)(colors are everywhere) etc.