Lazy Beaver: Difference between revisions
Jump to navigation
Jump to search
(Created page with "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 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: {| class="wikitable" |+ ! ! ! colspan="5" |States |- ! ! !2 !3 !4 !5 !6 |- | rowspan="5" |Symbols |2 |7 |22 |72 |427 |8,407 |- |3 |23 |351 | | | |- |4...") |
m (→Computed Values: Add missing value) |
||
| Line 30: | Line 30: | ||
|23 | |23 | ||
|351 | |351 | ||
| | |189,270 | ||
| | | | ||
| | | | ||
Revision as of 06:58, 13 July 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 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 | |||||