Random Access Model
- Tags
- comp-sci
A generic random-access machine where instructions are executed one after another with no concurrent operations. This model is often used to argue and reason about the behaviour of an algorithm including its runtime complexity.