Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
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.
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Fernando Martinez, Juntao Chen, et al.
AAAI 2025
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998