User:Merieke/2D TMs: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
Merieke (talk | contribs)
No edit summary
Merieke (talk | contribs)
fixed
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
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.
This page is not being used anymore, if you want 2D TMs go to [[2D Tms|This page]]
 
'''Rules'''
 
* Going up or down is not required for each step.
 
* The head starts on the lowermost tape.
 
*A step can't just be going up or down. If it goes up or down it also has to go left or right.
 
 
 
The Champion for BB(2,2,2) is this. S(2,2,2) > 11 and <math>\Sigma</math>(2,2,2) > 5
{| class="wikitable"
|+Top
|
|0
|1
|-
|A
|1RDB
|H
|-
|B
|0LA
|1RDB
|}
{| class="wikitable"
|+Bottom
|
|0
|1
|-
|A
|1RUB
|0LUA
|-
|B
|1LA
|1LA
|}

Latest revision as of 21:00, 28 October 2026

This page is not being used anymore, if you want 2D TMs go to This page