All public logs
Jump to navigation
Jump to search
Combined display of all available logs of BusyBeaverWiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).
- 18:22, 16 February 2025 Racheline talk contribs moved page Least busy beaver to Least Busy Beaver (consistency)
- 18:04, 16 February 2025 Sligocki talk contribs created page Least busy beaver (Created page with "The '''least busy beaver''' <math>BB^-(n, m)</math> problem is a variation of the busy beaver problem which considers TM behavior across all starting tapes (not just blank tapes like the traditional BB problem) invented by racheline on 15 Feb 2025. == Definition == Let <math>BB_{init}(n, m, T)</math> be the longest runtime for all n-state m-symbol TMs which halt when started on tape configuration T (where T is allowed to be any infinite tape configuration, including one...")