This paper introduces an activation hierarchy and proves a Predictor-Impossibility Theorem, showing that no effective predictor family can determine all stage languages. It also establishes a slice th…

The paper proves that for resources with structural parallelizability (like divisibility and transferability), it is impossible to enforce a linear cost for concentrating influence, demonstrating that…

The authors resolve the contradiction between deterministic crash-tolerant consensus in a fully asynchronous environment and the FLP impossibility result by demonstrating that one protocol phase separ…

The paper reframes LLM reliability from an impossible universal problem to a manageable, local patch-based problem, showing that sufficient interventions can be found by focusing on recurring failure…

This paper establishes mathematical limits of AGI safety, proving structural unverifiability as the core barrier.

This paper investigates the closeness of singularity for $n imes n$ unimodular matrices, specifically for $(2k+1)$-ary and $(k+1)$-ary cases of $4 imes 4$ nonnegative unimodular matrices.

This paper establishes a finite combinatorial version of Gödel's incompleteness theorems in Boolean $K$-SAT, resolving assignment correlations and constructing structurally irreducible SAT/UNSAT pairs…

The paper analyzes the potential market impact of a large, unknown Bitcoin holder (the Satoshi overhang) and concludes that the mechanical downside risk is bounded, suggesting the terminal states are…

The paper proposes FeasiGen, a method to automatically create infeasible tasks for tool-using agents, and finds that most current agents struggle significantly to detect and stop when faced with such…

The paper provides a constructive, intuitionistically valid proof of Rice's Theorem and the Halting Problem undecidability by reducing the problem to the undecidability of Hilbert's Tenth Problem (MRD…

This paper investigates the convergence and stability of equilibria in bimatrix two-player games using the optimistic exponential weights method, allowing step sizes to differ.

This paper proposes a method for auditing parliamentary elections to certify a winning majority instead of individual seats, reducing the number of ballots inspected by almost a thousand-fold.

This paper proves that winner determination under Stable Voting and Simple Stable Voting is PSPACE-complete.

This paper improves an algorithm for computing lower bounds on the margin of a Single Transferable Vote (STV) election, making risk-limiting audits more practical.

This paper introduces the concept of 'large' zeros in linear recurrence sequences and establishes that they either do not exist or are very sparse, which could lead to decidability of the Skolem Probl…

This paper proves that the satisfiability problem of existential Presburger arithmetic extended with divisibility predicates (EPAD) is PP-hard.