Lazy Beaver - Revision history

Sligocki: Right align table.

2025-08-14T19:12:01Z

Right align table.

← Older revision		Revision as of 19:12, 14 August 2025
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;"
	\|+		\|+
	!		!

Polygon: Added >0 requirement

2025-08-14T19:04:02Z

Added >0 requirement

← Older revision		Revision as of 19:04, 14 August 2025
Line 1:		Line 1:
	The '''Lazy Beaver''' function is a computable variation of the Busy Beaver function defined by Scott Aaronson in his 2020 review.		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.		LB(n, m) is the smallest k > 0 such that no n-state, m-symbol [[Turing machine]] halts in exactly k steps.

	== Computed Values ==		== Computed Values ==

Qwerpiw at 19:25, 26 July 2025

2025-07-26T19:25:29Z

← Older revision		Revision as of 19:25, 26 July 2025
Line 57:		Line 57:

	== See Also ==		== See Also ==

			[[category:Functions]]

	* https://oeis.org/A337805		* https://oeis.org/A337805

Sligocki: /* Computed Values */ Add missing value

2025-07-13T06:58:48Z

Computed Values: Add missing value

← Older revision		Revision as of 06:58, 13 July 2025
Line 30:		Line 30:
	\|23		\|23
	\|351		\|351
	\|		\|189,270
	\|		\|
	\|		\|

Sligocki: 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..."

2024-09-25T15:19:22Z

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..."

New page

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 [[User:Sligocki|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
|93
|242,789
|
|
|
|-
|5
|956
|
|
|
|
|-
|6
|33,851
|
|
|
|
|}

== See Also ==

* https://oeis.org/A337805