Elevator performs the first fully static, heuristic-free whole-program binary translation from x86-64 to AArch64 by exhaustively interpreting every byte and composing ISA-derived code tiles.
Title resolution pending
9 Pith papers cite this work. Polarity classification is still indexing.
9
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 9roles
background 1polarities
background 1representative citing papers
A unified algebraic account reduces RNN expressivity to syntactic monoid division in wreath products and shows diagonal state-space models realize every even-modulus counter under unsigned-integer quantization but none under floating-point recurrences.
LLMEval-Logic is a solver-verified Chinese logical reasoning benchmark with 246 base and 190 hard items that shows frontier LLMs reach only 37.5% hard-item accuracy and 60.16% joint formalization score.
Abstaining AI systems cannot guarantee both large coverage of correct answers and zero hallucination in sufficiently expressive domains, as shown by the existence of inseparable pairs in the arithmetical hierarchy.
All control systems perform computation according to ART, including purely mechanical ones like the centrifugal governor, which therefore cannot serve as a counter-example in cognitive computationalism.
Reproducible experiments compute physical functions via a Church-Turing bridge, compatible with finite precision through computable analysis, while separating existence, computability, and protocol-independence questions.
A single C program is formally proven to harbor countably infinitely many distinct, CVE-assignable vulnerabilities, implying the set of all software vulnerabilities is infinite.
Turing's work relies on Cantor's contributions; a new undecidability measure and U-complete, D-complete, H-complete classes are defined, with a negative answer to a P-vs-NP analog for undecidable problems.
citing papers explorer
-
Deterministic Fully-Static Whole-Binary Translation without Heuristics
Elevator performs the first fully static, heuristic-free whole-program binary translation from x86-64 to AArch64 by exhaustively interpreting every byte and composing ISA-derived code tiles.
-
An Algebraic View of the Expressivity of Recurrent Language Models
A unified algebraic account reduces RNN expressivity to syntactic monoid division in wreath products and shows diagonal state-space models realize every even-modulus counter under unsigned-integer quantization but none under floating-point recurrences.
-
LLMEval-Logic: A Solver-Verified Chinese Benchmark for Logical Reasoning of LLMs with Adversarial Hardening
LLMEval-Logic is a solver-verified Chinese logical reasoning benchmark with 246 base and 190 hard items that shows frontier LLMs reach only 37.5% hard-item accuracy and 60.16% joint formalization score.
-
Hallucination, abstention, and computable inseparability
Abstaining AI systems cannot guarantee both large coverage of correct answers and zero hallucination in sufficiently expressive domains, as shown by the existence of inseparable pairs in the arithmetical hierarchy.
-
When does a control system compute? Digital, mechanical and open-loop systems
All control systems perform computation according to ART, including purely mechanical ones like the centrifugal governor, which therefore cannot serve as a counter-example in cognitive computationalism.
-
Experiments, Computability, and the Existence of Physical Functions
Reproducible experiments compute physical functions via a Church-Turing bridge, compatible with finite precision through computable analysis, while separating existence, computability, and protocol-independence questions.
-
Vulnerability Abundance: A formal proof of infinite vulnerabilities in code
A single C program is formally proven to harbor countably infinitely many distinct, CVE-assignable vulnerabilities, implying the set of all software vulnerabilities is infinite.
-
Turing or Cantor: That is the Question
Turing's work relies on Cantor's contributions; a new undecidability measure and U-complete, D-complete, H-complete classes are defined, with a negative answer to a P-vs-NP analog for undecidable problems.
- Remarks on Primitive Regulation