ConceptTheory & Algos
Random access machine
The algorithmic model we really work in when we do algorithms, where memory access is random.
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
2Each in their own terms, from the easiest level.
Erik Demaine
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.
Connections
6The lectures that define it or assume it, and the concepts next to it.