论文信息 - Sequential and jumping machines and their relation to computers

Sequential and jumping machines and their relation to computers

SummaryWe consider sequential and jumping machines as generalized computers, and note that complexity bounds on internal operations are required to distinguish the two classes. We then place these notions, as well as tesselation automata, in the framework of a general definition of parallel stored program machines.

Michael A. Arbib | Karel Culík | M. Arbib | K. Culík

[1] John C. Shepherdson,et al. Computability of Recursive Functions , 1963, JACM.

[2] Michael A Arbib,et al. Theories of abstract automata (Prentice-Hall series in automatic computation) , 1969 .

[3] Michael A. Arbib,et al. Theories of abstract automata , 1969, Prentice-Hall series in automatic computation.

[4] K. Culík. Combinatorial problems in the theory of complexity of algorithmic nets without cycles for simple computers , 1971 .

[5] Robert D. Tennent,et al. Semantics of programming languages , 1991, Prentice Hall International Series in Computer Science.

[6] Abraham Robinson,et al. Random-Access Stored-Program Machines, an Approach to Programming Languages , 1964, JACM.