A mechanical proof of the Turing completeness of pure LISP (1984)
| Venue: | In Automated Theorem Proving: After 25 Years, W.W. Bledsoe and D.W. Loveland, Eds., American Mathematical Society |
| Citations: | 12 - 7 self |
BibTeX
@INPROCEEDINGS{Boyer84amechanical,
author = {Robert S. Boyer and J Strother Moore},
title = {A mechanical proof of the Turing completeness of pure LISP},
booktitle = {In Automated Theorem Proving: After 25 Years, W.W. Bledsoe and D.W. Loveland, Eds., American Mathematical Society},
year = {1984},
pages = {133--167},
publisher = {American Mathematical Society}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe a proof by a computer program of the Turing completeness of a computational paradigm akin to Pure LISP. That is, we define formally the notions of a Turing machine and of a version of Pure LISP and prove that anything that can be computed by a Turing machine can be computed by LISP. While this result is straightforward, we believe this is the first instance of a machine proving the Turing completeness of another computational paradigm.
Citations
| 714 | Theory of recursive functions and effective computability, McGraw-Hill - Rogers - 1967 |
| 98 | Metafunctions: Proving Them Correct and Using Them Efficiently as New Proof Procedures - Boyer, Moore - 1981 |
| 14 | A mechanical proof of the unsolvability of the halting problem - Boyer, Moore - 1984 |
| 1 | A Computational Logic - Broadway - 1977 |
