Figure 10:
An asymmetric tree architecture that computes the superpositions of the form F(x,y,z)=g(x,f(h(x,y),z)). These are characterized in example 8.

An asymmetric tree architecture that computes the superpositions of the form F(x,y,z)=g(x,f(h(x,y),z))⁠. These are characterized in example 8.

Close Modal
This Feature Is Available To Subscribers Only

or Create an Account

Close Modal
Close Modal
This site uses cookies. By continuing to use our website, you are agreeing to our privacy policy. No content on this site may be used to train artificial intelligence systems without permission in writing from the MIT Press.
Accept