Conference paper
Can hospitals afford digital storage for imagery?
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994
Mathematical programming is Turing complete, and can be used as a general-purpose declarative language. We present a new constructive proof of this fact, and showcase its usefulness by discussing an application to finding the hardest input of any given program running on a Minsky Register Machine. We also discuss an application of mathematical programming to software verification obtained by relaxing one of the properties of Turing complete languages. © 2014 Springer Science+Business Media New York.
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems
Leo Liberti, James Ostrowski
Journal of Global Optimization
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences