Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
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.
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization