17
submitted 2 months ago by Owl@hexbear.net to c/technology@hexbear.net

The Busy Beaver numbers are how long a Turing Machine of some size can run and still halt. There are different ways of formulating them, but the most common is the number of steps a 2-symbol, N-state machine can run before halting. These numbers go 1, 6, 21, 107, 47176870.

The 6th number is already known to be higher than 10⇈15.

top 1 comments
sorted by: hot top controversial new old
[-] Owl@hexbear.net 4 points 2 months ago

Wasn't sure where to post this; we don't have a /c/math.

this post was submitted on 02 Jul 2024
17 points (100.0% liked)

technology

23177 readers
125 users here now

On the road to fully automated luxury gay space communism.

Spreading Linux propaganda since 2020

Rules:

founded 4 years ago
MODERATORS