BB(3): Revision history

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.

curprev 08:2708:27, 25 August 2025‎ Int-y1 talk contribs‎ m 2,892 bytes −6‎ edit cps link

curprev 10:5010:50, 11 August 2025‎ Polygon talk contribs‎ 2,898 bytes +4‎ Added link to "champions"

curprev 23:4223:42, 10 August 2025‎ Polygon talk contribs‎ 2,894 bytes +1‎ Prepare Category move of BB-domains

curprev 01:5601:56, 29 April 2025‎ Sligocki talk contribs‎ 2,893 bytes +230‎ →‎Techniques: Note how TC + CPS is all you need for BB(3). Tag: Visual edit

curprev 18:2718:27, 6 February 2025‎ Sligocki talk contribs‎ 2,663 bytes +23‎ Add domain category Tag: Visual edit

curprev 11:1011:10, 13 August 2024‎ DF376 talk contribs‎ 2,640 bytes +30‎ Updated the templates

curprev 04:1704:17, 12 July 2024‎ Sligocki talk contribs‎ 2,610 bytes +210‎ →‎Champions: Note no shared champions Tag: Visual edit
curprev 03:4303:43, 12 July 2024‎ Sligocki talk contribs‎ 2,400 bytes +1,021‎ Add some longest running halters Tag: Visual edit
curprev 03:3403:34, 12 July 2024‎ Sligocki talk contribs‎ 1,379 bytes +39‎ partial recurrence Tag: Visual edit
curprev 03:2703:27, 12 July 2024‎ Sligocki talk contribs‎ 1,340 bytes +1,340‎ Created page with "The 3-state 2-symbol Busy Beaver problem '''BB(3)''' was proven by Shen Lin in his 1963 doctoral dissertation<ref>Shen Lin. 1963. Computer studies of Turing machine problems. PhD dissertation. Ohio State University. https://etd.ohiolink.edu/acprod/odb_etd/etd/r/1501/10?clear=10&p10_accession_num=osu1486554418657614</ref> and republished in 1965.<ref>Lin, Shen; Radó, Tibor (April 1965). "Computer Studies of Turing Machine Problems". ''Journal of the ACM''. '''12''' (2):..." Tag: Visual edit: Switched

BB(3): Revision history

25 August 2025

11 August 2025

10 August 2025

29 April 2025

6 February 2025

13 August 2024

12 July 2024

Navigation menu