A Mechanical Proof of the Unsolvability of the Halting Problem-Reference-Cited by-同舟云学术

A Mechanical Proof of the Unsolvability of the Halting Problem

Published:1984-06-26 Issue:3 Volume:31 Page:441-458
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Boyer Robert S.¹,Moore J. Strother¹

Affiliation:

1. The University of Texas at Austin, Austin, Texas

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference9 articles.

1. BOYER R. S. AND MOORE J S. Computational Logic. Academic Press New York 1979. BOYER R. S. AND MOORE J S. Computational Logic. Academic Press New York 1979.

2. Newton's Method, Circle Maps, and Chaotic Motion

3. MCCARTIIY J. ABRAHAMS P.W. EDWARDS D.J. HART T.P. AND LEVIN M.I.LISP 1.5 Programmer's Manual The MIT Press Cambridge Mass. 1965. MCCARTIIY J. ABRAHAMS P.W. EDWARDS D.J. HART T.P. AND LEVIN M.I.LISP 1.5 Programmer's Manual The MIT Press Cambridge Mass. 1965.

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. PyDaskShift: Automatically Convert Loop-Based Sequential Programs to Distributed Parallel Programs;Communications in Computer and Information Science;2024

2. Formalization of the Computational Theory of a Turing Complete Functional Language Model;Journal of Automated Reasoning;2022-01-30

3. Partitionable Programs Using Tyro V2;Communications in Computer and Information Science;2022

4. Generating Mutually Inductive Theorems from Concise Descriptions;Electronic Proceedings in Theoretical Computer Science;2020-09-29

5. Epimenides, Gödel, Turing: An Eternal Gölden Twist;SN Computer Science;2020-09-24