Manuscript En05-A@1 · En05-A.tex · section · f076e703
Routing from every starting tick
Finite programs, syntactic admissibility, and routing › Routing from every starting tick · lines 814–820
This is a simulation of the complete finite instrument. It is not an exact finite-gate compilation theorem for arbitrary specified unitaries, an efficiency theorem, or a claim that each administrative redex is itself the terminal evaluation of an isolated term.