Log In Sign Up

Program algebra for Turing-machine programs

by   J. A. Bergstra, et al.

This note presents an algebraic theory of instruction sequences with instructions for Turing tapes as basic instructions, the behaviours produced by the instruction sequences concerned under execution, and the interaction between such behaviours and the Turing tapes provided by an execution environment. This theory provides a setting for investigating issues relating to computability and computational complexity that is more general than the closely related Turing-machine models of computation. The theory is essentially an instantiation of a parameterized algebraic theory which is the basis of a line of research in which issues relating to a wide variety of subjects from computer science have been rigorously investigated thinking in terms of instruction sequences.


page 1

page 2

page 3

page 4


A short introduction to program algebra with instructions for Boolean registers

A parameterized algebraic theory of instruction sequences, objects that ...

Program algebra for random access machine programs

This paper presents an algebraic theory of instruction sequences with in...

Quantum Random Self-Modifiable Computation

Among the fundamental questions in computer science, at least two have a...

Levels of Abstraction and the Apparent Contradictory Philosophical Legacy of Turing and Shannon

In a recent article, Luciano Floridi explains his view of Turing's legac...

Anti-Turing Machine

The invention of CPU-centric computing paradigm was incredible breakthro...

Turing Number: How Far Are You to A. M. Turing Award?

The ACM A.M. Turing Award is commonly acknowledged as the highest distin...

The Computational Theory of Intelligence: Applications to Genetic Programming and Turing Machines

In this paper, we continue the efforts of the Computational Theory of In...