F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
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.
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology