Elevator performs the first fully static whole-program binary translation from x86-64 to AArch64 without heuristics by exhaustively considering all byte interpretations and composing reusable code tiles.
Title resolution pending
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
years
2026 6representative citing papers
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 whole-program binary translation from x86-64 to AArch64 without heuristics by exhaustively considering all byte interpretations and composing reusable code tiles.
-
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.