Abstract—The classical Turing machine model has defects in centralized control, sequential and determinate execution. So it is difficult to describe the computing in parallel environments and interactive systems. In this paper, we introduce several ideas for the extension of the classical Turing machine model, including three aspects: the input and output, process of state transformation and transformation rules. Focused on two aspects of scheduling method and the interaction model, we compare the differences in state control rules between the classical Turing machine model and the Internet model, then trying to extend the classical Turing machine model with the help of the network model. Finally, we introduce the role of virtualization in ...
A Turing machine has an important role in education in the field of computer science, as it is a mil...
We enhance the notion of a computation of the classical theory of computing with the notion of inter...
Nowadays computation is typically understood through the Turing machine model, in the fields of comp...
In this paper, a dynamic model of computation based on the Universal Turing Machine is proposed. Thi...
AbstractThe principal ideas of a universal computer are gradually introduced into a functional model...
Pascal’s mechanical calculator and Babbage’s Analytic Engine set the stage for a great deal of moder...
Title: Universal Turing machine Author: Viktor Bahýľ Department: Department of Algebra Supervisor: R...
This paper presents Persistent Turing Machines (PTMs), a new way of interpret-ing Turing-machine com...
At CWI and Eindhoven University of Technology in the Netherlands, we enhanced the notion of a comput...
htmlabstractWe enhance the notion of a computation of the classical theory of computing with the no...
AbstractThis paper presents persistent Turing machines (PTMs), a new way of interpreting Turing-mach...
The article describes the issues of preparation and verification of mathematical models of computing...
In this paper, the problem of applying changes to software at runtime is considered. The computabili...
In this paper, the problem of applying changes to software at runtime is considered. The computabili...
A Turing machine has an important role in education in the field of computer science, as it is a mil...
We enhance the notion of a computation of the classical theory of computing with the notion of inter...
Nowadays computation is typically understood through the Turing machine model, in the fields of comp...
In this paper, a dynamic model of computation based on the Universal Turing Machine is proposed. Thi...
AbstractThe principal ideas of a universal computer are gradually introduced into a functional model...
Pascal’s mechanical calculator and Babbage’s Analytic Engine set the stage for a great deal of moder...
Title: Universal Turing machine Author: Viktor Bahýľ Department: Department of Algebra Supervisor: R...
This paper presents Persistent Turing Machines (PTMs), a new way of interpret-ing Turing-machine com...
At CWI and Eindhoven University of Technology in the Netherlands, we enhanced the notion of a comput...
htmlabstractWe enhance the notion of a computation of the classical theory of computing with the no...
AbstractThis paper presents persistent Turing machines (PTMs), a new way of interpreting Turing-mach...
The article describes the issues of preparation and verification of mathematical models of computing...
In this paper, the problem of applying changes to software at runtime is considered. The computabili...
In this paper, the problem of applying changes to software at runtime is considered. The computabili...
A Turing machine has an important role in education in the field of computer science, as it is a mil...
We enhance the notion of a computation of the classical theory of computing with the notion of inter...
Nowadays computation is typically understood through the Turing machine model, in the fields of comp...