David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
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 Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Igor Devetak, Andreas Winter
ISIT 2003
Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007