Corpus ID: 237592566

Machines as Programs: P $\neq$ NP

@inproceedings{Mize2021MachinesAP,
  title={Machines as Programs: P \$\neq\$ NP},
  author={Jonathan Mize},
  year={2021}
}
  • Jonathan Mize
  • Published 20 September 2021
  • Computer Science, Mathematics
The Curry–Howard correspondence is often called the proofs-as-programs result. I offer a generalization of this result, something which may be called machines as programs. Utilizing this insight, I introduce two new Turing Machines called “Ceiling Machines.” The formal ingredients of these two machines are nearly identical. But there are crucial differences, splitting the two into a “Higher Ceiling Machine” and a “Lower Ceiling Machine.” A potential graph of state transitions of the Higher… Expand

Figures from this paper

References

SHOWING 1-6 OF 6 REFERENCES
The Semantic Conception of Truth and the Foundations of Semantics
X is true if, and only if, p. [...] we shall call a definition of truth “adequate” if all these equivalences follow from it. [...] The definition of truth which was outlined above [...] implies allExpand
Practical Formal Software Engineering: Wanting the Software You Get
TLDR
This book takes an engineering approach to illuminate the creation and verification of large software systems in which theorems and axioms are intuited as the formalism materializes through practice. Expand
Relativizations of the P =? Question.
  • SIAM Journal on Computing
  • 1975
P-versus-NP page. url: https://www.win.tue.nl/~gwoegi/Pversus-NP.htm
  • (Retrieved September
  • 2021