Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s10878-014-9715-3 | Journal of Combinatorial Optimization |
Keywords | Field | DocType |
Static analysis,Abstract interpretation,Code verification | Programming language,Turing completeness,Computer science,Theoretical computer science,Register machine,Mathematical optimization,Combinatorics,Universal Turing machine,Super-recursive algorithm,Turing tarpit,Turing machine,Turing machine examples,Non-deterministic Turing machine | Journal |
Volume | Issue | ISSN |
28 | 1 | 1382-6905 |
Citations | PageRank | References |
5 | 0.70 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Leo Liberti | 1 | 1280 | 105.20 |
| Fabrizio Marinelli | 2 | 258 | 20.55 |