2 papers
cs.LO2026
Determination of the fifth Busy Beaver value
The bbchallenge Collaboration, Justin Blanchard, Daniel Briggs +17
The Busy Beaver value is the maximum number of steps that an -state 2-symbol Turing machine can perform from the all-zero tape before halting. was historically introd…
cs.SE2025
Automatic Test-Case Reduction in Proof Assistants: A Case Study in Coq
Jason Gross, Théo Zimmermann, Rajashree Agrawal +1
As the adoption of proof assistants increases, there is a need for efficiency in identifying, documenting, and fixing compatibility issues that arise from proof assistant evolution…