Random-Access Machine

An abstract sequential machine model for algorithm analysis that represents a processor operating on an unbounded array of memory cells, each accessible in unit time by address, and a standard set of primitive operations; used to study time and space complexity under the assumption of unit-cost arithmetic and constant-time memory access.