Multi-tape TMs: Difference between revisions
Jump to navigation
Jump to search
Created page with "A" |
A very very very brief outline of the function. Def need to add more |
||
| 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. | |||
Latest revision as of 23:47, 19 October 2026
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.