Manuscript En05-A@1 · En05-A.tex · remark · f076e703
Remark: Termination is not a tick bound
Finite programs, syntactic admissibility, and routing › Routing from every starting tick · lines 831–836
Strong normalization bounds reductions, not externally inserted idle ticks or unsuccessful routing attempts. A finite completion horizon requires a chosen finite scheduled execution, a finite progress condition, or the explicit routing construction above.