Multi-tape Turing Machines - Revision history

Loader3229: Loader3229 moved page 2D Tms to Multi-tape Turing Machines

2026-10-30T08:42:18Z

Loader3229 moved page 2D Tms to Multi-tape Turing Machines

← Older revision		Revision as of 08:42, 30 October 2026
(No difference)

Merieke: added a champion

2026-10-28T22:03:53Z

added a champion

@@ 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. All of the champions have been hand simulated (which hopefully will change soon) which means that none of them will be optimal at all.
 Rules
@@ Line 11: / Line 11: @@
-The Champion for BB(2,2,2) is this. S(2,2,2) > 16. Sigma(2,2,2) > 6 but not from this TM
+The Champion for BB(2,2,2) is this. S(2,2,2) > 16. Sigma<math>\Sigma</math>(2,2,2) > 6 but not from this TM
 {| class="wikitable"
@@ Line 31: / Line 31: @@
 |-
 | B || 1RA || halt
 |}

Merieke: added stuff

2026-10-28T21:05:40Z

added stuff

← Older revision		Revision as of 21:05, 28 October 2026
Line 8:		Line 8:
	* A step can just be going up or down.		* A step can just be going up or down.
	* Each tape needs it own instructions		* Each tape needs it own instructions
			* BB(n,m,1) = BB(n,m)

Merieke: Created page with " 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 just be going up or down. * Each tape needs it own instructions The Champion for BB(2,2,2) is this. S(2,2,2) > 16. Sigma(2..."

2026-10-28T20:58:40Z

Created page with " 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 just be going up or down. * Each tape needs it own instructions The Champion for BB(2,2,2) is this. S(2,2,2) > 16. Sigma(2..."

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.

Rules

* Going up or down is not required for each step.
* The head starts on the lowermost tape.
* A step can just be going up or down.
* Each tape needs it own instructions

The Champion for BB(2,2,2) is this. S(2,2,2) > 16. Sigma(2,2,2) > 6 but not from this TM

{| class="wikitable"
|+ Top
|-
| || 0 || 1
|-
| A || 1RB || 0LB
|-
| B || 0LDA || 0RDB
|}

{| class="wikitable"
|+ Bottom
|-
| || 0 || 1
|-
| A || 0LUA || 1LUB
|-
| B || 1RA || halt
|}