Cover Image

Measuring Decidability as Related to Busy Beaver Numbers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tandi, Gurpreet, Gonzalez-Hendrix, Josue, Brown, Jonathan
Format:	Preprint
Published:	2026
Subjects:	Computational Complexity Logic in Computer Science Logic Number Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Higher Order Busy Beaver Function
by: Cao, Zining
Published: (2025)

Effective Versions of Strong Measure Zero
by: Rayman, Matthew
Published: (2025)

Measuring robustness of dynamical systems. Relating time and space to length and precision
by: Blanc, Manon, et al.
Published: (2023)

On the Number of Quantifiers Needed to Define Boolean Functions
by: Carmosino, Marco, et al.
Published: (2024)

Proof Complexity of Linear Logics
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)

Parallelism and Adaptivity in Student-Teacher Witnessing
by: Ježil, Ondřej, et al.
Published: (2026)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
by: Nechesov, Andrey
Published: (2024)

An order out of nowhere: a new algorithm for infinite-domain CSPs
by: Mottet, Antoine, et al.
Published: (2023)

The Proof Analysis Problem
by: Arteche, Noel, et al.
Published: (2025)

Proof complexity of positive branching programs
by: Das, Anupam, et al.
Published: (2021)

The complete classification for quantified equality constraints
by: Zhuk, Dmitriy, et al.
Published: (2021)

Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)

On the consistency of stronger lower bounds for NEXP
by: Thapen, Neil
Published: (2025)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
by: Atserias, Albert, et al.
Published: (2024)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
by: Zhuk, Dmitriy
Published: (2024)

Non-commutative linear logic fragments with sub-context-free complexity
by: Nishimiya, Yusaku, et al.
Published: (2025)

Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic
by: Gokaj, Geri, et al.
Published: (2025)

The Descriptive Complexity of Relation Modification Problems
by: Chudigiewitsch, Florian, et al.
Published: (2026)

Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution
by: Beyersdorff, Olaf, et al.
Published: (2021)

On Deciding the Data Complexity of Answering Linear Monadic Datalog Queries with LTL Operators(Extended Version)
by: Artale, Alessandro, et al.
Published: (2025)

Complex solutions of polynomial equations on the unit circle
by: Aslanyan, Vahagn
Published: (2024)

The Existential Closedness and Zilber-Pink Conjectures
by: Aslanyan, Vahagn
Published: (2024)

Is uniform expressivity too restrictive? Towards efficient expressivity of graph neural networks
by: Khalife, Sammy, et al.
Published: (2024)

Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations
by: Blanc, Manon, et al.
Published: (2023)

On Probabilistic and Causal Reasoning with Summation Operators
by: Ibeling, Duligur, et al.
Published: (2024)

Network Satisfaction Problems Solved by k-Consistency
by: Bodirsky, Manuel, et al.
Published: (2023)

Multi-Structural Games and Beyond
by: Carmosino, Marco, et al.
Published: (2023)

Parallel Play Saves Quantifiers
by: Carmosino, Marco, et al.
Published: (2024)

In Memory of Martin Davis
by: Calvert, Wesley, et al.
Published: (2024)

Decidability of Extensions of Presburger Arithmetic by Hardy Field Functions
by: Brown, Hera, et al.
Published: (2025)

Verifying Quantized GNNs With Readout Is Decidable But Highly Intractable
by: Chernobrovkin, Artem, et al.
Published: (2025)

New Bounds for the Ideal Proof System in Positive Characteristic
by: Behera, Amik Raj, et al.
Published: (2025)

Kleene algebra with commutativity conditions is undecidable
by: de Amorim, Arthur Azevedo, et al.
Published: (2024)

Hard Clique Formulas for Resolution
by: Atserias, Albert
Published: (2026)

Optimal Lower Bounds for Symmetric Modular Circuits
by: Pago, Benedikt
Published: (2026)

Termination of Real Linear Loops
by: Neumann, Eike, et al.
Published: (2026)

Extending CDCL to disjunctions of parity equations
by: Beame, Paul, et al.
Published: (2026)

Aspects of Coherence in Dependence Logic
by: Barlag, Timon, et al.
Published: (2026)

Dynamic Planar Graph Isomorphism is in DynFO
by: Datta, Samir, et al.
Published: (2026)

Near-Optimal Encodings of Cardinality Constraints
by: Krapivin, Andrew, et al.
Published: (2026)