A Mechanical Proof of the Unsolvability of the Halting Problem

DOI10.1145/828.1882zbMath0629.68088OpenAlexW2034636167MaRDI QIDQ3766888

Robert S. Boyer, J. Strother Moore

Publication date: 1984

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/828.1882

zbMATH Keywords

program verificationPure LISPunsolvability of the halting problem

Mathematics Subject Classification ID

Related Items (4)

A two-valued logic for properties of strict functional programs allowing partial functions ⋮ Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion ⋮ Formalization of the computational theory of a Turing complete functional language model ⋮ The problem of induction

This page was built for publication: A Mechanical Proof of the Unsolvability of the Halting Problem