Heng Cao, Haifeng Xi, et al.
WSC 2003
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.
Heng Cao, Haifeng Xi, et al.
WSC 2003
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Martin C. Gutzwiller
Physica D: Nonlinear Phenomena