Affiliation:
1. Masschusetts Institute of Technology, Cambridge, Massachusetts
Abstract
A computer is a set
M
(the memory), a set
B
, a class of maps
S
:
M
→
B
, known as states, and a class @@@@ of maps
T
: @@@@ → @@@@, known as instructions. Each instruction
I
has an input region
IR
(
I
), an output region
OR
(
I
), and affected regions
AR
(
M′
,
I
), for
M′
⊆
IR
(
I
). For example, let
I
be the instruction (
CLA Y
) on the IBM 7094. If
L
is the location counter and
AC
is the accumulator, then
IR
(
I
) =
Y
∪
L
and
OR
(
I
) =
AC
∪
L
; if
M′
is the address portion of
Y
, then
AR
(
M′
,
I
) is the address portion of
AC
. The fundamental properties of all these notions are derived, and computers are related to other models, such as sequential machines. The existence problem (how arbitrarily the input, output and affected regions of an instruction can be specified) is fully settled for countable memory
M
.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献