Characterization of line width variation
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
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.
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003