The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian

DOI10.3233/COM-180217OpenAlexW3114729984MaRDI QIDQ4995608

Edgar G. Daylight

Publication date: 25 June 2021

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-180217

zbMATH Keywords

undecidabilitysecuritycomputability theoryhalting problemInternet of things

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Social processes and proofs of theorems and programs
• Fundamental concepts in programming languages
• Christopher Strachey and fundamental concepts
• From Turing machines to computer viruses
• Towards a Historical Notion of ‘Turing—the Father of Computer Science’
• Computational Artifacts
• Algorithms and the Mathematical Foundations of Computer Science
• Correspondence

This page was built for publication: The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian