Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
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.
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Charles Micchelli
Journal of Approximation Theory
Shu Tezuka
WSC 1991
Jaione Tirapu Azpiroz, Alan E. Rosenbluth, et al.
SPIE Photomask Technology + EUV Lithography 2009