Instruction-Limited Busy Beaver: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)

18 July 2025

17 July 2025

16 July 2025

  • curprev 23:3723:37, 16 July 2025‎ Sligocki talk contribs‎ 2,251 bytes +1,378‎ Add table of champions Tag: Visual edit
  • curprev 21:4721:47, 16 July 2025‎ Sligocki talk contribs‎ 873 bytes +873‎ Created page with "An '''n-instruction Turing machine''' is a Turing machine with an arbitrary number of states and symbols, but limited to only ''n'' defined transitions/instructions in its transition table (all others are undefined). The '''Limited Instruction Busy Beaver''' (BBi(n)) problem is the Busy Beaver problem limited to n-instruction TMs. So BBi(n) is the longest runtime for all halting n-instruction TMs when started on a blank tape. A TM is considered to halt as soon as it..."
(newest | oldest) View ( | older 50) (20 | 50 | 100 | 250 | 500)
Retrieved from "https://wiki.bbchallenge.org/wiki/Instruction-Limited_Busy_Beaver"