Lazy Beaver: Difference between revisions
Jump to navigation
Jump to search
(Added >0 requirement) |
m (Right align table.) |
||
| Line 5: | Line 5: | ||
== Computed Values == | == Computed Values == | ||
Values found by Terry and [[User:Sligocki|Shawn Ligocki]] in 2021: | Values found by Terry and [[User:Sligocki|Shawn Ligocki]] in 2021: | ||
{| class="wikitable" | {| class="wikitable" style="text-align: right;" | ||
|+ | |+ | ||
! | ! | ||
Latest revision as of 19:12, 14 August 2025
The Lazy Beaver function is a computable variation of the Busy Beaver function defined by Scott Aaronson in his 2020 review.
LB(n, m) is the smallest k > 0 such that no n-state, m-symbol Turing machine halts in exactly k steps.
Computed Values
Values found by Terry and Shawn Ligocki in 2021:
| States | ||||||
|---|---|---|---|---|---|---|
| 2 | 3 | 4 | 5 | 6 | ||
| Symbols | 2 | 7 | 22 | 72 | 427 | 8,407 |
| 3 | 23 | 351 | 189,270 | |||
| 4 | 93 | 242,789 | ||||
| 5 | 956 | |||||
| 6 | 33,851 | |||||