Add to ORKGUniform simulations of nondeterministic real time multitape turing machines. - In: Mathematical systems theory. 19. 1987. S. 277-299
AbstractIn 1985, Dymond and Tompa showed that every deterministic Turing machine with linear tapes a...
Abstract: From the physico-mathematical view point, the imitation game between man and machine, prop...
International audienceIn this paper, we consider the relation between spatial machines, Turing machi...
Uniform simulations of nondeterministic real time multitape turing machines. - In: Mathematical syst...
AbstractThe standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one es...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
grantor: University of TorontoThis thesis studies models and limitations of non-uniform co...
AbstractFor all d ⩾ 1 and all e >d, every deterministic multihead e-dimensional Turing machine of ti...
AbstractFor d and k > 2, d-dimensional k-tape Turing machines cannot simulate d-dimensional Turing m...
AbstractThe main result of this paper is that, given a Turing machineMwithk-heads on ad-dimensional ...
The diploma work presents the Turing machine, its use and functionality. The Turing machine is not a...
The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a determin...
It is shown that the uniform halting problem for one-state Turing machines is solvable. It remains s...
The classes of sequences generated by time- and space- restricted multiple counter machines are comp...
This paper deals with the simulation of Turing machines by neural networks. Such networks are made u...
AbstractIn 1985, Dymond and Tompa showed that every deterministic Turing machine with linear tapes a...
Abstract: From the physico-mathematical view point, the imitation game between man and machine, prop...
International audienceIn this paper, we consider the relation between spatial machines, Turing machi...
Uniform simulations of nondeterministic real time multitape turing machines. - In: Mathematical syst...
AbstractThe standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one es...
On-line simulation of real-time (k + 1)-tape Turing machines by k-tape Turing machines requires time...
grantor: University of TorontoThis thesis studies models and limitations of non-uniform co...
AbstractFor all d ⩾ 1 and all e >d, every deterministic multihead e-dimensional Turing machine of ti...
AbstractFor d and k > 2, d-dimensional k-tape Turing machines cannot simulate d-dimensional Turing m...
AbstractThe main result of this paper is that, given a Turing machineMwithk-heads on ad-dimensional ...
The diploma work presents the Turing machine, its use and functionality. The Turing machine is not a...
The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a determin...
It is shown that the uniform halting problem for one-state Turing machines is solvable. It remains s...
The classes of sequences generated by time- and space- restricted multiple counter machines are comp...
This paper deals with the simulation of Turing machines by neural networks. Such networks are made u...
AbstractIn 1985, Dymond and Tompa showed that every deterministic Turing machine with linear tapes a...
Abstract: From the physico-mathematical view point, the imitation game between man and machine, prop...
International audienceIn this paper, we consider the relation between spatial machines, Turing machi...