Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain universal machines, partial recursive functions, as well as NP-complete problems. While our theory reflects the classical over Z (e.g., the computable functions are the recursive functions) it also reflects the special mathematical character of the underlying ring R (e.g., complements of Julia sets provide natural examples of R. E. undecidable sets over the reals) and provides a natural setting for studying foundational issues concerning algorithms in numerical analysis. © 1989 American Mathematical Society.
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994
Simeon Furrer, Dirk Dahlhaus
ISIT 2005