Symbol manipulation with an associative memory

  • Authors:
  • Robert R. Seeber

  • Affiliations:
  • -

  • Venue:
  • ACM '61 Proceedings of the 1961 16th ACM national meeting
  • Year:
  • 1961

Quantified Score

Hi-index 0.00

Visualization

Abstract

In extending the capabilities of a computer in the direction of solving what might be called problems of higher intellect, much work has been done, on association list structures and on programs for processing lists. A typical word in such a structure would be divided into two halves, each of which would “point” to, i.e., give the address of, another word. From such a word it is possible to determine a pair of successor words. Determining the predecessor may not be easy, particularly where common substructure is permitted, that is, where some list may serve as a portion of two or more lists without in itself being repeated.