Manuscript En05-A@1 · En05-A.tex · section · f076e703
The compositional requirement
Finite programs, syntactic admissibility, and routing › The compositional requirement · lines 702–708
The geometric theorem applies to arbitrary semantically admissible channels. Syntactic admissibility is a stronger implementation condition; it does not assert that every arbitrary instrument is expressible over the available gate library.
Nearby in this section
- assumption: Assumption: Finite compositional program interface
- section: The compositional requirement
- definition: Definition: Syntactic admissibility
- proposition: Proposition: Finite path accounting
- section: The compositional requirement
- proposition: Proposition: Soundness of finite syntactic networks
- remark: Remark: Finite network versus one strongly normalizing term