The Random-Access Stored Program (RASP) model is anidealized version of the familiar von Neumannstyle computer. This model will be shown equivalent to the Turing machine model.
We will be concerned here only with arithmeticcomputations involving Nat = {0, 1, 2, … }. Signedarithmetic and non-integers can be treated by thesame means we employ here, but add technical complications that cloud the conceptual clarity ofthe relationship between models.
Previous slide | Next slide | Back to first slide | View graphic version |