Nimrod Megiddo
Journal of Symbolic Computation
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.
Nimrod Megiddo
Journal of Symbolic Computation
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics