Multi-tape TMs

From BusyBeaverWiki
Revision as of 23:47, 19 October 2026 by Merieke (talk | contribs) (A very very very brief outline of the function. Def need to add more)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Multi-tape Turing Machines are like normal Turing machines but with more tapes. BB(n,m,o) = the maximum number of steps taken by a n state, m symbol, o tape Turing machine. In addition to going left and right, it can also go up and down.