David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
The expressive power of the data flow schemes of Dennis is evaluated. It is shown that data flow schemes have the power to express an arbitrary determinate functional. The proof involves a demonstration that “restricted data flow schemes” can simulate Turing Machines. This provides a new. simple basis for computability. © 1980, All rights reserved.
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010