W.C. Tang, H. Rosen, et al.
SPIE Optics, Electro-Optics, and Laser Applications in Science and Engineering 1991
Paper
The equivalence of R.E. program schemes and data flow schemes
Abstract
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.
Related
Fernando Martinez, Juntao Chen, et al.
AAAI 2025
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Imran Nasim, Michael E. Henderson
Mathematics