Halting still standing -- programs versus specifications

DOI10.1007/978-3-642-16690-7_11MaRDI QIDQ3055749zbMATH OpenOpenAlexFDO

Authors Cornelis Huizing, Ruurd Kuiper, Tom Verhoeff

Publication date 9 November 2010

Published in Unifying Theories of Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16690-7_11

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• A Mechanical Proof of the Unsolvability of the Halting Problem
• The problem of termination of programs
• scientific article; zbMATH DE number 4021118
• Some thoughts on hypercomputation
• scientific article; zbMATH DE number 2085172

Cited in

(3)

• Pseudo-extensions of computable functions
• scientific article; zbMATH DE number 4021118 (Why is no real title available?)
• Generalizations of Rice's theorem, applicable to executable and non-executable formalisms

This page was built for publication: Halting still standing -- programs versus specifications

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