arXiv AI By Sergey Salishev

An Engineering Reading of the Bounded Halting Problem and Observable Properties of a Universal Machine

Read the original on arXiv AI →

arXiv:2611. 06303v1 Announce Type: cross Abstract: The halting problem asks whether a program eventually halts, with unrestricted resources.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Sep 24

Algorithmic Unverifiability of Safety for Fixed and Recursively Self-Improving Systems

The paper proves that algorithmic safety verification for Turing‑complete, self‑modifying systems—whether fixed or recursively self‑improving—is fundamentally limited. Statistically, no verifier can be sound, complete, and tractable across unbounded domains, all finite configurations, or succinctly described finite environments, due to Rice’s, Gödel’s, Trakhtenbrot’s, coNP, and PSPACE barriers. Dynamically, even a single self‑modification step can render safety properties undecidable, and no total supervisory algorithm can guarantee correctness for all such transformations, though a monitor that raises alarms on violations remains feasible. whyItMatters":"The results show that formal safety guarantees for recursive self‑improvement are unattainable, highlighting intrinsic verification barriers for advanced AI systems."

By Jose Pascual Gumbau Mezquita
arXiv AI
Aug 21

LLM Capability Limits: Static Emergence and Dynamic Boundary Control

arXiv:2608. 01548v3 Announce Type: replace Abstract: Test-time emergence in LLM systems has a deployment boundary: additional computation can realize decisions already supported by the deployed information--execution structure, while evidence, tools, memory, and executable semantics can change the class inherited by later computation.

By Yi Liu