scientific article; zbMATH DE number 4021118

MaRDI QIDQ3764141zbMATH OpenFDO

Authors Leslie Burkholder

Publication date 1986

zbMATH Keywords

abstraction axiomhalting problem

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Undecidability and degrees of sets of sentences (03D35) Axiomatics of classical set theory and its fragments (03E30) Algorithms in computer science (68W99)

Recommendations

• A Mechanical Proof of the Unsolvability of the Halting Problem
• The problem of termination of programs
• scientific article; zbMATH DE number 2085172
• Formalization of the undecidability of the halting problem for a functional language
• Halting still standing -- programs versus specifications

Cited in

(8)

• Formalization of the undecidability of the halting problem for a functional language
• The origins of the halting problem
• A Parameterized Halting Problem
• Halting still standing -- programs versus specifications
• A Mechanical Proof of the Unsolvability of the Halting Problem
• The problem of termination of programs
• On the practical value of different definitional translations to normal form
• scientific article; zbMATH DE number 2085172 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3764141)