The problem of termination of programs

MaRDI QIDQ4600393zbMATH OpenFDO

Authors Paulo Mateus

Publication date 9 January 2018

Full work available at URL http://revistas.rcaap.pt/boletimspm/article/view/3875

zbMATH Keywords

computable functioncomputable real numberprogramundecidible problem

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Undecidability and degrees of sets of sentences (03D35) Computation over the reals, computable analysis (03D78) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• A Mechanical Proof of the Unsolvability of the Halting Problem
• Formalization of the undecidability of the halting problem for a functional language
• scientific article; zbMATH DE number 4021118
• scientific article; zbMATH DE number 1114344
• What is a computation?

Cited in

(14)

• Formalization of the undecidability of the halting problem for a functional language
• Most programs stop quickly or never halt
• Decision incorporation in meta-heuristics to cope with decision scheduling problems
• scientific article; zbMATH DE number 2084325 (Why is no real title available?)
• Halting still standing -- programs versus specifications
• scientific article; zbMATH DE number 4021118 (Why is no real title available?)
• A Mechanical Proof of the Unsolvability of the Halting Problem
• Some Program Anomalies and the Parameter Theorem
• scientific article; zbMATH DE number 2085172 (Why is no real title available?)
• The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian
• What is a computation?
• Termination of processes
• Decidability of the halting problem for Matiyasevich deterministic machines
• The DNF exception problem

This page was built for publication: The problem of termination of programs

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