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.
2020
2020
Involutory Turing Machines
An involutory function, also called involution, is a function \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage… 
2019
2019
Teaching Students to Use the Gauss Method for Integer Matrices when Implemented on a Computer
The paper is written on the basis of a part of “Analysis of algorithms” course for students of the Computer science department of… 
2016
2016
The winner decision model of tic tac toe game by using multi-tape turing machine
The Tic tac toe is very popular game having a 3 × 3 grid board and 2 players. A Special Symbol (X or O) is assigned to each… 
2015
2015
Testing a new idea to solve the P = NP problem with mathematical induction
Background. P and NP are two classes (sets) of languages in Computer Science. An open problem is whether NP P  . This paper… 
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… 
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… 
1971
1971
On restricted turing computability
In this paper we continue the study, begun by Hartmanis and Stearns [1], of multitape Turing machines which compute infinite… 
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… 
1967
1967
Turing Machines with a Schedule to Keep
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)