Constraint-failure boundary E: Height Bounds, Search, and Halting Certificates
Year: 2026
Type: preprint
Abstract: “Finite is not decidability, closure is not decidability, and even finiteness in proofis not decidability. Decidability requires an auditable halting certificate.” This paper writes the halting certificate in a six-tuple registration format: an object headerX plus the five-piece set B, S, T, D, V, and divides it into two channels, Type I(height-bound type) and Type II (obstruction type); Type II carries the halting evidence by means of a verifiable obstruction object and is not rejected on the groundof lacking a height bound. The four-cell halting wall, the three witnesses, the fourexecution questions, and the death registration table merge at the same audit interface: the four-cell readings are filled in according to a fixed subsyntax, the threewitnesses map one-to-one onto the four cells, the four execution questions providethe downgrade channel for external claims, and the death registration table issuesan existence proof for the failure coordinates. The four-layer separation theoremholds when the three computability preconditions are all in place, and the proofobligation rule is a definitional clause within the model. All numerical readings aremachine-checked prior to the main text: a decidable positive example with the torsion triple complete, a reconciliation in which the Pell equation parametric channeland the box-search channel agree on eight solutions, a signature reading of a genustwo curve whose in-box search admits no completeness certificate, and a four-cellwalk-through of a Selmer-type curve. Readings are only registered, not promoted;negative conclusions are uniformly conditionalized; this paper does not announceany answer to Hilbert’s tenth problem over the rationals, and that problem remainsopen.
Authors: zhou, changzheng, zhou, ziqing
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7233588733
Cites:
Cited by:
Related to:
