Skip to search formSkip to main contentSkip to account menu

Multitape Turing machine

Known as: Multi-tape Turing machine 
A Multi-tape Turing machine is like an ordinary Turing machine with several tapes. Each tape has its own head for reading and writing. Initially the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Alternating Turing machineAutomata theoryComputational complexity of mathematical operationsComputational complexity theory

Broader (1)

Turing machine

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
О сложности построения таблицы простых чисел на машине Тьюринга
It is proved that the complexity of computing the table of primes up to n on a multitape Turing machine is O(n log n). 
Review
2006
Review
2006
TRANSACTIONS ON COMPUTERS , MAY 1970 Reviews of Papers in the Computer Field
Although considerable progress has been made in the understanding of the more "algebraic" properties of context-free languages… 
1993
1993
Convenient computational models
We now give a unified description of a class of computational models. Let us start with the example of multitape Turing machines… 
1992
1992
Alternating Function Classes Within
We de ne the notion of adding \small amounts" of nondeterminism to a deterministic function class, and give a machine model; the… 
1986
1986
LOWER BOUNDS IN PARALLEL MACHINE COMPUTATIONbyPaul
In this thesis we prove lower bounds for parallel random access machines (PRAM's) which consist of processors acting… 
1984
1984
Towards separating nondeterminism from determinism
The main result of this paper is a separation result: there is a positive integerk such that for all well-behaving functionst(n… 
1983
1983
On the Simulation of Many Storage Heads by a Single One (Extended Abstract)
Each multitape Turing machine, of which the storage heads scan O(log n) distinct squares in each interval of n steps, for all n… 
1977
1977
Computational complexity of multitape turing machines and random access machines
In recent years there has been an increasing interest in analyzing the computational complexity of programs. The multitape Turing… 
1976
1976
On Families of Languages Defined by Time-Bounded Random Access Machines
There are essentially two results described in this paper. First, it is shown that for any random access machine (RAM) time… 
Review
1970
Review
1970
R70-1 A Note on Computing Time for the Recognition of Context- Free Languages by a Single-Tape Turing Machine
Although considerable progress has been made in the understanding of the more "algebraic" properties of context-free languages… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)