This report describes research carried out during a final year B.Sc. research project. The research is based on the work of Moore and Sato. A function converts Turing machines into switching baker's maps. The theory of switching baker's maps and the converter function are both explained and adapted. A switching baker's map simulator is implemented and used to recognise a number of languages in the Chomsky hierarchy. The computation path of the switching baker's map simulator is graphically represented and output patterns are examined
AbstractThis paper reasons about the need to seek for particular kinds of models of computation that...
This paper presents Persistent Turing Machines (PTMs), a new way of interpret-ing Turing-machine com...
In this paper, a dynamic model of computation based on the Universal Turing Machine is proposed. Thi...
The diploma work presents the Turing machine, its use and functionality. The Turing machine is not a...
In the early 90’s, mathematicians were tiresome to design an operative computation model headed for ...
Includes bibliographical references (pages 32-33)The subject of this paper is Turing machines. I hav...
AbstractThis paper introduces a Turing machine and pushdown automata simulators as a virtual environ...
The purpose of this paper is to outline an approach for the development of the Tape Machines model ...
Discussions of Turing computability often use a rather crude high level language to specify the acti...
By means of some sample dialogues we show the use of a program to generate Berkeley Pascal programs ...
In this thesis, the theory related to Turing machines and means of their description (with focus on ...
AbstractIn a previous paper, we used Maurer machines to model and analyse micro-architectures. In th...
AbstractThe principal ideas of a universal computer are gradually introduced into a functional model...
In a previous paper, we used Maurer machines to model and analyse micro-architectures. In the curren...
The Turing Machine, originally proposed in 1936, is a primitive model which nevertheless embodies co...
AbstractThis paper reasons about the need to seek for particular kinds of models of computation that...
This paper presents Persistent Turing Machines (PTMs), a new way of interpret-ing Turing-machine com...
In this paper, a dynamic model of computation based on the Universal Turing Machine is proposed. Thi...
The diploma work presents the Turing machine, its use and functionality. The Turing machine is not a...
In the early 90’s, mathematicians were tiresome to design an operative computation model headed for ...
Includes bibliographical references (pages 32-33)The subject of this paper is Turing machines. I hav...
AbstractThis paper introduces a Turing machine and pushdown automata simulators as a virtual environ...
The purpose of this paper is to outline an approach for the development of the Tape Machines model ...
Discussions of Turing computability often use a rather crude high level language to specify the acti...
By means of some sample dialogues we show the use of a program to generate Berkeley Pascal programs ...
In this thesis, the theory related to Turing machines and means of their description (with focus on ...
AbstractIn a previous paper, we used Maurer machines to model and analyse micro-architectures. In th...
AbstractThe principal ideas of a universal computer are gradually introduced into a functional model...
In a previous paper, we used Maurer machines to model and analyse micro-architectures. In the curren...
The Turing Machine, originally proposed in 1936, is a primitive model which nevertheless embodies co...
AbstractThis paper reasons about the need to seek for particular kinds of models of computation that...
This paper presents Persistent Turing Machines (PTMs), a new way of interpret-ing Turing-machine com...
In this paper, a dynamic model of computation based on the Universal Turing Machine is proposed. Thi...