User:Merieke/2D TMs - Revision history

Merieke: fixed

2026-10-28T21:00:30Z

fixed

← Older revision		Revision as of 21:00, 28 October 2026
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) > 16~~
	~~{\| class="wikitable"~~
	~~\|+Top~~
	\|
	\|0
	\|1
	\|-
	\|A
	~~\|1RB~~
	~~\|0LB~~
	\|-
	\|B
	~~\|0LDA~~
	~~\|0RDB~~
	\|}
	~~{\| class="wikitable"~~
	~~\|+Bottom~~
	\|
	\|0
	\|1
	\|-
	\|A
	~~\|0LUA~~
	~~\|1LUB~~
	\|-
	\|B
	~~\|1RA~~
	\|H
	\|}

Merieke: new champion gg

2026-10-24T12:33:43Z

new champion gg

← Older revision		Revision as of 12:33, 24 October 2026
Line 11:		Line 11:


	The Champion for BB(2,2,2) is this. S(2,2,2) > ~~11 and <math>\Sigma</math>(2,2,2) > 5~~		The Champion for BB(2,2,2) is this. S(2,2,2) > 16
	{\| class="wikitable"		{\| class="wikitable"
	\|+Top		\|+Top
Line 19:		Line 19:
	\|-		\|-
	\|A		\|A
	\|~~1RDB~~		\|1RB
	\|H		\|0LB
	\|-		\|-
	\|B		\|B
	\|~~0LA~~		\|0LDA
	\|~~1RDB~~		\|0RDB
	\|}		\|}
	{\| class="wikitable"		{\| class="wikitable"
Line 33:		Line 33:
	\|-		\|-
	\|A		\|A
	~~\|1RUB~~
	\|0LUA		\|0LUA
			\|1LUB
	\|-		\|-
	\|B		\|B
	\|~~1LA~~		\|1RA
	\|~~1LA~~		\|H
	\|}		\|}

Merieke at 22:33, 21 October 2026

2026-10-21T22:33:17Z

← Older revision		Revision as of 22:33, 21 October 2026
Line 7:		Line 7:
	* The head starts on the lowermost tape.		* 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.		*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		The Champion for BB(2,2,2) is this. S(2,2,2) > 11 and <math>\Sigma</math>(2,2,2) > 5
	{\| class="wikitable"		{\| class="wikitable"
	\|+Top		\|+Top

Merieke: added a champion

2026-10-21T22:32:24Z

added a champion

← Older revision		Revision as of 22:32, 21 October 2026
Line 7:		Line 7:
	* The head starts on the lowermost tape.		* 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.		* 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
			The Champion for BB(2,2,2) is this. S(2,2,2) = 11 and <math>\Sigma</math>(2,2,2) = 5
	{\| class="wikitable"		{\| class="wikitable"
	\|+Top		\|+Top
Line 18:		Line 19:
	\|-		\|-
	\|A		\|A
	\|		\|1RDB
	\|		\|H
	\|-		\|-
	\|B		\|B
	\|		\|0LA
	\|		\|1RDB
	\|}		\|}
	{\| class="wikitable"		{\| class="wikitable"
Line 32:		Line 33:
	\|-		\|-
	\|A		\|A
	\|		\|1RUB
	\|		\|0LUA
	\|-		\|-
	\|B		\|B
	\|		\|1LA
	\|		\|1LA
	\|}		\|}

Merieke: added stuff

2026-10-21T20:12:39Z

added stuff

← Older revision		Revision as of 20:12, 21 October 2026
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.		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.

			'''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
			{\| class="wikitable"
			\|+Top
			\|
			\|0
			\|1
			\|-
			\|A
			\|
			\|
			\|-
			\|B
			\|
			\|
			\|}
			{\| class="wikitable"
			\|+Bottom
			\|
			\|0
			\|1
			\|-
			\|A
			\|
			\|
			\|-
			\|B
			\|
			\|
			\|}

Merieke: added some stuff and will delete multi tape tm page bc not needed

2026-10-20T20:42:02Z

added some stuff and will delete multi tape tm page bc not needed

New page

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.