Once we make this change the model is no longer a counter machine, but rather a random-access machine.

In computer science, random-access machine (RAM) is an abstract machine in the general class of register machines.

In computer science, a parallel random-access machine (PRAM) is a shared-memory abstract machine.

The concept of a random-access machine (RAM) starts with the simplest model of all, the so-called counter machine model.

The parallel computer in the definition can be assumed to be a parallel, random-access machine (PRAM).

A random-access machine (RAM) is an abstract computational-machine model identical to a multiple-register counter machine with the addition of indirect addressing.

A CRCW PRAM is sometimes called a concurrent random-access machine.

Van Emde Boas (1990) calls these three plus the pointer machine "sequential machine" models, to distinguish them from "parallel random-access machine" models.

As its name indicates, the PRAM was intended as the parallel-computing analogy to the random-access machine (RAM).

Today, the counter, register and random-access machines and their sire the Turing machine continue to be the models of choice for theorists investigating questions in the theory of computation.

The RASP is a universal Turing machine (UTM) built on a random-access machine RAM chassis.

The arity required by the second-order formula was improved (in one direction) in Lynch's theorem, and several results of Grandjean have provided tighter bounds on nondeterministic random-access machines.

The RASP is a random-access machine (RAM) model that, unlike the RAM, has its program in its "registers" together with its input.

In the 1980s and 1990s, Uzi Vishkin co-authored several articles that helped building a theory of parallel algorithms in a mathematical model called parallel random access machine (PRAM), which is a generalization for parallel computing of the standard serial computing model random-access machine (RAM).