Constraint-failure boundary E: Height Bounds, Search, and Halting Certificates

“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

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24241313
Primary Topic
Computability, Logic, AI Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Constraint-failure boundary E: Height Bounds, Search, and Halting Certificates

changzheng zhou, ziqing zhou
Zenodo (CERN European Organization for Nuclear Research)
Computability, Logic, AI Algorithms
preprint

Constraint-failure boundary E: Height Bounds, Search, and Halting Certificates

changzheng zhou, ziqing zhou
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
Computability, Logic, AI Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon