This sketch does not claim that CJM bypasses Turing undecidability. The undecidability of the halting problem is instead one of the strongest constraints that the CJM hypothesis must confront. Finite SAT/3SAT encodings can represent only bounded execution traces; they do not convert the general halting problem into a finite decidable instance. If a physical CJM were nevertheless claimed to determine the halting status of arbitrary programs, such a claim would extend beyond P versus NP and beyond ordinary Turing computability. It would therefore require an explicit physical and mathematical account of why the CJM process is not itself subject to the computational assumptions underlying the diagonal argument. No such account is established in this sketch.