Computational Irreducibility from Projection: Undecidability of Selection Events in Coherent Quantum Dynamics

Projection, stable records, and threshold events do not by themselves imply algorithmic undecidability. Undecidability enters only after a dynamical realization is shown to simulate a universal machine uniformly for arbitrarily long admissible runs. This paper replaces an earlier generic claim by an auditable reachability framework. It imports, without duplicating, the conditional two-counter-machine theorem of the revised MTT Program A2 and proves four complementary results. First, a finite projection system can have noninjective descent, an absorbing record basin, and completely decidable selection. Second, undecidable reachability descends through a projection only under an effective semiconjugacy, admissibility, input, and target-fidelity contract. Third, a finite-horizon robust event is decidable once a complete positive-margin enclosure certificate is supplied. Fourth, a compact carrier cannot encode infinitely many distinct configurations with one uniform positive decoding radius; unbounded robust computation therefore requires shrinking margins, a non-totally-bounded carrier, a growing family of carriers, or another explicitly verified mechanism. We also prove that every finite trajectory prefix may be computable while unbounded target reachability is undecidable. Thus reachability undecidability is not a theorem that every trajectory is uncomputable, that no shortcut exists, or that projection creates universal computation. Current MTT has not yet supplied a selected physical embedding satisfying the complete unbounded robustness contract, so its physical selection-reachability claim remains conditional.