Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON
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.
Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
Harpreet S. Sawhney
IS&T/SPIE Electronic Imaging 1994