Cover Image

Determination of the fifth Busy Beaver value

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	The bbchallenge Collaboration, Blanchard, Justin, Briggs, Daniel, Deka, Konrad, Fenner, Nathan, Forster, Yannick, Georgiev, Georgi, House, Matthew L., Hunter, Rachel, Iijil, Kądziołka, Maja, Kropitz, Pavel, Ligocki, Shawn, mxdys, Naściszewski, Mateusz, savask, Stérin, Tristan, Xu, Chris, Yuen, Jason, Zimmermann, Théo
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Formal Languages and Automata Theory Logic 03D10, 03B35 (Primary) 68Q05, 68Q45 (Secondary) F.1.1; F.4.1; I.2.3; D.2.4; F.4.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)

The equational theory of the Weihrauch lattice with (iterated) composition
by: Pradic, Cécilia
Published: (2024)

Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width
by: Lopez, Aliaume
Published: (2024)

A correspondence between the time and space complexity
by: Latkin, Ivan V.
Published: (2023)

Arithmetics within the Linear Time Hierarchy
by: Pollett, Chris
Published: (2025)

A proof complexity conjecture and the Incompleteness theorem
by: Krajicek, Jan
Published: (2023)

Insignificant Choice Polynomial Time: A Logic Capturing PTIME
by: Schewe, Klaus-Dieter
Published: (2020)

Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)

Computability of Initial Value Problems
by: Brattka, Vasco, et al.
Published: (2024)

The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
by: Rahnama, Moses
Published: (2025)

Turing machines deciders, part I
by: The bbchallenge Collaboration, et al.
Published: (2025)

Extended Nullstellensatz proof systems
by: Krajicek, Jan
Published: (2023)

On the existence of strong proof complexity generators
by: Krajicek, Jan
Published: (2022)

Relative Constructibility via Generalised Sequential Algorithms
by: Lau, Desmond
Published: (2024)

A declarative approach to specifying distributed algorithms using three-valued modal logic
by: Gabbay, Murdoch J., et al.
Published: (2025)

The Solver's Paradox in Formal Problem Spaces
by: Rosko, Milan
Published: (2025)

Gödel Mirror: A Formal System For Contradiction-Driven Recursion
by: Chan, Jhet
Published: (2025)

Recursive windows for grammar logics of bounded density
by: Gasquet, Olivier
Published: (2025)

PSPACE-completeness of bimodal transitive weak-density logic
by: Balbiani, Philippe, et al.
Published: (2025)

Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)

Understanding and Improving Automated Proof Synthesis for Interactive Theorem Provers
by: Zhang, Manqing, et al.
Published: (2026)

$\mathbb{N}$-polyregular functions arise from well-quasi-orderings
by: Lopez, Aliaume
Published: (2024)

Behavioural Conformances based on Lax Couplings
by: Wild, Paul, et al.
Published: (2025)

Uniform Computability of PAC Learning
by: Brattka, Vasco, et al.
Published: (2026)

Nominal techniques as an Agda library
by: Gabbay, Murdoch J., et al.
Published: (2026)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
by: Huseynzade, Rafig
Published: (2025)

On the relative asymptotic expressivity of inference frameworks
by: Koponen, Vera, et al.
Published: (2022)

Computing Distinguishing Formulae for Threshold-Based Behavioural Distances
by: Forster, Jonas, et al.
Published: (2026)

QSeqSim: A Symbolic Simulator for Qiskit While Loops Using Sequential Quantum Circuits
by: Li, Zihao, et al.
Published: (2026)

Languages of Words of Low Automatic Complexity Are Hard to Compute
by: Chen, Joey, et al.
Published: (2025)

Quantitative Graded Semantics and Spectra of Behavioural Metrics
by: Forster, Jonas, et al.
Published: (2023)

Exploring the abyss in Kleene's computability theory
by: Sanders, Sam
Published: (2023)

On some computational properties of open sets
by: Normann, Dag, et al.
Published: (2024)

Decision Problems on Copying and Shuffling
by: Halava, Vesa, et al.
Published: (2023)

A Modular Lean 4 Framework for Confluence and Strong Normalization of Lambda Calculi with Products and Sums
by: Ramos, Arthur, et al.
Published: (2025)

A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
by: Bruse, Florian, et al.
Published: (2026)

Decidable Reversible Equivalences for Finite Petri Nets
by: Gorrieri, Roberto, et al.
Published: (2025)

Proof complexity of universal algebra in a CSP dichotomy proof
by: Gaysin, Azza
Published: (2024)

Weihrauch problems as containers
by: Pradic, Cécilia, et al.
Published: (2025)

Computing Non-Repetitive Sequences with a Computable Lefthanded Local Lemma
by: Mourad, Daniel
Published: (2024)