We analyze limits of prediction, computation, and control that arise as structural consequences of admissible description in Modal Triplet Theory. Prediction is defined as determination of admissible continuation rather than time evolution, and we introduce the notion of admissible prediction depth as an intrinsic measure of predictability. We show that finite admissibility, selection fronts, and nil obstructions imply that certain well-posed physical questions are undecidable within any admissible encoding, independently of computational power, algorithms, or information access. These limits are structural rather than epistemic and persist even with idealized computation. We further show that limits on prediction imply corresponding limits on control and intervention. The results unify predictive limits, irreversibility, quantization boundaries, and horizons as manifestations of the same admissibility structure.
Peter Nero (Fri,) studied this question.