All Topics
All Topics
Technology
Technology
Design
Design
Programming
Programming
Science
Science
News
News
Gaming
Gaming
Entertainment
Entertainment
Business
Business
Finance
Finance
Sports
Sports
Health
Health
Food
Food
Travel
Travel
Art
Art
Music
Music
Books
Books
Education
Education
Politics
Politics
Personal
Personal
No algorithm. No AI slop. No ads. Just RSS. Pro-human. Indie writers. Real journalism. Open web. Chronological. Hand toasted.

Researchers Formally Verify Fifth Busy Beaver Value S(5) = 47,176,870 Using Coq Proof Assistant

By

marvinborner

8mo ago· 2 min readenNews

Summary

A collaborative research team has successfully determined the fifth Busy Beaver value S(5) = 47,176,870 using the Coq proof assistant, marking the first new Busy Beaver value discovery in over 40 years and the first to be formally verified. The proof involved enumerating 181,385,789 Turing machines with 5 states and determining whether each halts, representing a major breakthrough in theoretical computer science and computability theory.

Key quotes

· 4 pulled
We prove that $S(5) = 47,176,870$ using the Coq proof assistant.
The Busy Beaver value $S(n)$ is the maximum number of steps that an $n$-state 2-symbol Turing machine can perform from the all-zero tape before halting.
Our result marks the first determination of a new Busy Beaver value in over 40 years and the first Busy Beaver value ever to be formally verified.
The proof enumerates $181,385,789$ Turing machines with 5 states and, for each machine, decides whether it halts or not.
Snippet from the RSS feed
We prove that $S(5) = 47,176,870$ using the Coq proof assistant. The Busy Beaver value $S(n)$ is the maximum number of steps that an $n$-state 2-symbol Turing machine can perform from the all-zero tape before halting, and $S$ was historically introduced b

You might also wanna read