Anonymous user
Register Machine Model of Computation: Difference between revisions
Register Machine Model of Computation (view source)
Revision as of 00:23, 26 November 2017
, 6 years ago→The Random Access Machine model: here and elsewhere I have stubbed out the parts I intend to revisit or finish later.
| [unchecked revision] | [unchecked revision] |
(→The Random Access Machine model: here and elsewhere I have stubbed out the parts I intend to revisit or finish later.) |
|||
Line 47:
== The Random Access Machine model ==
The Random-Access Machine is an abstract model that closely resembles the structure of a conventional computer. It consists of a data memory divided into a set of cells, arranged linearly and monotonically (that is to say, the cells follow each other in a strictly numeric order, and each cell is the same 'size' in the address space - which doesn't ''necessarily'' reflect its capacity to hold data), where the cells can be accessed by a numeric address; an instruction memory, which may or may not be the same as the data memory, but is similarly structured; a set of operations which it can perform; a set of instructions, encoded in a form which could be held in a set of memory cells, which act to direct which operation to perform; and a Program Counter, which holds the address of a cell in the instruction memory which encodes which operation to perform next.
{{stub}}
| |||