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.
2002
2002
How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q
Abstract Let us recall that Raphael Robinson's Arithmetic Q is an axiom system that differs from Peano Arithmetic essentially by… 
2001
2001
Solving the Word Problem in Real Time
The paper is devoted to the study of groups whose word problem can be solved by a Turing machine which operates in real time. A… 
1999
1999
Fast Computations of the Exponential Function
In this paper we present an algorithm which shows that the exponential function has algebraic complexity O(log2 n), i.e., can be… 
1986
1986
A Fast Numerical Algorithm for the Composition of Power Series with Complex Coefficients
1981
1981
Space-bounded simulation of multitape turing machines
A new proof of a theorem of Hopcroft, Paul, and Valiant is presented: Every deterministic multitape Turing machine of time… 
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… 
1972
1972
Pushdown Automata with Counters
  • T. Kameda
  • Journal of computer and system sciences (Print)
  • 1972
  • Corpus ID: 33102186
Highly Cited
1968
Highly Cited
1968
Time and Tape Complexity of Pushdown Automaton Languages
1967
1967
Turing Machines with a Schedule to Keep
Highly Cited
1966
Highly Cited
1966
Turing Machines with Restricted Memory Access
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)