Sign inSign in

Random access machine

The algorithmic model we really work in when we do algorithms, where memory access is random.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Lecturers

2

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Introductory

    A model of computation where random access memory is modeled as a big array of machine words that can be accessed in constant time given their address.
    • 7:51Models of Computation, Random Access Machine & Document Distance

Connections

6

The lectures that define it or assume it, and the concepts next to it.

Concepts4

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.