Generalizations of Rice's theorem, applicable to executable and non-executable formalisms

DOI10.29007/JNL6MaRDI QIDQ6874952zbMATH OpenFDO

Authors Cornelis Huizing, Ruurd Kuiper, Tom Verhoeff

Publication date 14 January 2026

Full work available at URL https://doi.org/10.29007/JNL6

zbMATH Keywords

execution-based computation formalismsgeneralized Rice theoremhalting theoremspecification-based computation formalisms

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Undecidability and degrees of sets of sentences (03D35) General topics in the theory of software (68N01) Classical models of computation (Turing machines, etc.) (68Q04)

Cites work

• Halting still standing -- programs versus specifications
• scientific article; zbMATH DE number 3700811 (Why is no real title available?)
• Retrospective and Prospective for Unifying Theories of Programming
• The intensional content of Rice's theorem

This page was built for publication: Generalizations of Rice's theorem, applicable to executable and non-executable formalisms

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