Manuscript En05-A@1 · En05-A.tex · remark · f076e703

Remark: Finite network versus one strongly normalizing term

Finite programs, syntactic admissibility, and routing › The compositional requirement · lines 762–768

Back to manuscript

The proposition does not turn an indefinitely driven substrate into a reduction sequence of one fixed term. For example, an external driver may request a new gate at every tick forever, although every requested local program terminates. Strong normalization of individual terms does not prohibit that external drive.

Nearby in this section