Chai Wah Wu
Linear Algebra and Its Applications
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.
Chai Wah Wu
Linear Algebra and Its Applications
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.