AbstractThe principal ideas of a universal computer are gradually introduced into a functional model of the Turing machine. The strict sequentiality of this model is confronted with parallelism observed in real computers.This paper follows up the presentation [1] and is complemented by [2,3]
Several abstract models of fine-grained parallelism, suited to symbolic programming languages, are s...
Several abstract models of fine-grained parallelism, suited to symbolic programming languages, are s...
AbstractA new definition of universal Turing machines is introduced which allows to obtain universal...
Title: Universal Turing machine Author: Viktor Bahýľ Department: Department of Algebra Supervisor: R...
In this paper we present the problems previously encountered in the academic literature related to T...
AbstractLet UTM(m, n) be the class of universal Turing machine with m states and n symbols. Universa...
A computer is classically formalised as a universal Turing machine or a similar device. However over...
A computer is classically formalised as a universal Turing machine or a similar device. However over...
The importance of algorithms is now recognized in all mathematical sciences, thanks to the developm...
19 pagesSo far, following the works of A.M. Turing, the algorithms were considered as the mathematic...
Universal to systems so various and complex as the foundations of mathematics, cryptography, compute...
Turing Machine is one of the earliest device in programming to describe or interpret a model for alg...
19 pagesSo far, following the works of A.M. Turing, the algorithms were considered as the mathematic...
Includes bibliographical references (pages 32-33)The subject of this paper is Turing machines. I hav...
19 pagesSo far, following the works of A.M. Turing, the algorithms were considered as the mathematic...
Several abstract models of fine-grained parallelism, suited to symbolic programming languages, are s...
Several abstract models of fine-grained parallelism, suited to symbolic programming languages, are s...
AbstractA new definition of universal Turing machines is introduced which allows to obtain universal...
Title: Universal Turing machine Author: Viktor Bahýľ Department: Department of Algebra Supervisor: R...
In this paper we present the problems previously encountered in the academic literature related to T...
AbstractLet UTM(m, n) be the class of universal Turing machine with m states and n symbols. Universa...
A computer is classically formalised as a universal Turing machine or a similar device. However over...
A computer is classically formalised as a universal Turing machine or a similar device. However over...
The importance of algorithms is now recognized in all mathematical sciences, thanks to the developm...
19 pagesSo far, following the works of A.M. Turing, the algorithms were considered as the mathematic...
Universal to systems so various and complex as the foundations of mathematics, cryptography, compute...
Turing Machine is one of the earliest device in programming to describe or interpret a model for alg...
19 pagesSo far, following the works of A.M. Turing, the algorithms were considered as the mathematic...
Includes bibliographical references (pages 32-33)The subject of this paper is Turing machines. I hav...
19 pagesSo far, following the works of A.M. Turing, the algorithms were considered as the mathematic...
Several abstract models of fine-grained parallelism, suited to symbolic programming languages, are s...
Several abstract models of fine-grained parallelism, suited to symbolic programming languages, are s...
AbstractA new definition of universal Turing machines is introduced which allows to obtain universal...
DOI
Add to ORKG