An amorphous algorithm for learning ordered sequences: memorizing the multiplication table
Panayotis A. Skordos · 2004
An amorphous algorithm is presented that memorizes ordered sequences of tokens such as the multiplication table, telephone numbers, and arbitrary alphanumeric strings. The amorphous model consists of a set of information-processing nodes which are identical, independent, asynchronous, message-passing between neighbors, and in unspecified physical locations. For simplicity communication between neighbors is assumed to occur via wires and not via radio. The nodes absorb incoming tokens of information using time-controlled accepting and rejecting rules of behavior, and during this absorbing process the nodes make logical connections between them that have the structure of a tree. Retrieval occurs by matching all parts of a stored sequence. The amorphous program is presented, and a simulator is developed to test the program. Future plans are given how to extend the present approach to other memory tasks and more complex computations.