论文信息 - A Mechanical Proof of the Unsolvability of the Halting Problem

A Mechanical Proof of the Unsolvability of the Halting Problem

Abstract : The authors describe a proof by a computer program of the unsolvability of the halting problem. The halting problem is posed in a constructive, formal language. The computational paradigm formalized is Pure LISP, not Turing machines. They believe this is the first instance of a machine proving that a given problem is not solvable by machine.

Robert S. Boyer | J. Strother Moore

[1] Donald G. Saari,et al. NEWTON'S METHOD, CIRCLE MAPS, AND CHAOTIC MOTION , 1984 .

[2] John McCarthy,et al. LISP 1.5 Programmer's Manual , 1962 .

[3] A. Church. The calculi of lambda-conversion , 1941 .

[4] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[5] Bruce Lercher,et al. Recursive Number Theory , 1958, The Mathematical Gazette.

[6] J. S. Moore,et al. Proof Checking The RSA Public Key Encryption Algorithm , 1984 .

[7] Robert S. Boyer,et al. Metafunctions: Proving Them Correct and Using Them Efficiently as New Proof Procedures. , 1979 .

[8] Robert S. Boyer,et al. A Mechanical Proof of the Turing Completeness of Pure LISP. , 1983 .