John R. Kender, Rick Kjeldsen
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.
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Igor Devetak, Andreas Winter
ISIT 2003
James Lee Hafner
Journal of Number Theory
A.R. Gourlay, G. Kaye, et al.
Proceedings of SPIE 1989