Answers are grounded in this paper and cite their sources.
Study separates four concepts in Modal Triplet Theory, indicating crucial algorithmic implications.
We separate four notions that were conflated in the first version of Program A2: finite admissible prediction depth, underdetermination at a branching relation, algorithmic undecidability, and computational lower bounds. Prediction depth is a chart- and protocol-relative iteration diagnostic. It is finite only under a certified finite barrier along the declared continuations; finite depth alone does not imply undecidability. A selection reachability problem becomes algorithmically undecidable if a selected MTT realization robustly and uniformly embeds a universal two-counter machine, preserves every finite machine prefix, and identifies halting with a selected target event. We prove this conditional transfer theorem and also prove the complementary finite-capacity result: a fixed finite carrier with computable transitions has decidable reachability and therefore cannot satisfy the unbounded embedding contract. Neither non-Markovianity, noninjective projection, branching, nor nil termination supplies that contract by itself. Computational irreducibility additionally requires a specified computation model and a lower-bound theorem. Probability, quantization, physical time, and universal limits of control remain separate source obligations.
No takes yet. Share an insight, caveat, or question.
Peter Nero (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: