Conference paper
Single and dual wavelength exposure of photoresist
J. LaRue, C. Ting
Proceedings of SPIE 1989
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.
J. LaRue, C. Ting
Proceedings of SPIE 1989
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Fernando Martinez, Juntao Chen, et al.
AAAI 2025
James Lee Hafner
Journal of Number Theory