Overview

multitape Turing machine


Related Overviews

 

'multitape Turing machine' can also refer to...

 

More Like This

Show all results sharing this subject:

  • Computing

GO

Show Summary Details

Quick Reference

A Turing machine that has a finite number of tapes, each tape having a tape head that can move independently. Such machines have the same computational power as single-tape Turing machines. Consider a multitape Turing machine M. If for no input word of length n does M scan more than L(n) cells on any tape then M is said to be an L(n) tape-bounded Turing machine. If for no input word of length n does M make more than T(n) moves before halting then M is said to be a T(n) time-bounded Turing machine.

Subjects: Computing.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.