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

  title={The halting problem and security's language-theoretic approach: Praise and criticism from a technical historian},
  author={Edgar G. Daylight},
The term ‘Halting Problem’ arguably refers to computer science’s most celebrated impossibility result and to the core notion underlying the language-theoretic approach to security. Computer professionals often ignore the Halting Problem however. In retrospect, this is not too surprising given that several advocates of computability theory implicitly follow Christopher Strachey’s alleged 1965 proof of his Halting Problem (which is about executable – i.e., hackable – programs) rather than Martin… 
1 Citations
Addressing the Question "What is a Program Text?": via Turing Scholarship
For decades, a range of disciplines (from engineering and computer science to philosophy, law, and history) have seen debates over the nature of computer programs. Various scholars—including Paul


Towards a Historical Notion of ‘Turing—the Father of Computer Science’
In this paper, attempts are made to reconstruct networks of scholars and ideas prevalent in the 1950s, and to identify a specific group of actors interested in theorizing about computations in computers and attracted to the idea of language as a frame in which to understand computation.
The limits of correctness
Over the last ten years, the Defense Department has spent many millions of dollars on a new computer technology called “program verification” a branch of computer science whose business, in its own terms, is to “prove programs correct”.
Exploit Programming: From Buffer Overflows to "Weird Machines" and Theory of Computation
Hacker-driven exploitation research has developed into a discipline of its own, concerned with practical exploration of how unexpected computational properties arise in actual multi-layered,
Turing Machines
In 1 900 David Hilbert, the preeminent mathematician of his time, chal­ lenged the world of mathematics with a list of unsolved problems, pre­ sented in Paris before the International Congress of M
Effective Computation by Humans and Machines
It is argued that if the Gandy–Sieg account is correct, then the notion of effective computability has changed after 1936, and today computer scientists view effective computable in terms of finite machine computation.
The Dawn of Software Engineering: From Turing to Dijkstra
The Dawn of Software Engineering: from Turing to Dijkstra, Edgar G. Daylight deromanticizes Turing's & logic's role in the history of computing and vividly describes how & why DijkStra's ideas stood out among those of his contemporaries.
Philosophy and Computer Science
In the September 1988 issue of Communcations of the ACM, the primary publication of the Association for Computing Machinery, an article appeared in which I advanced an appraisal of the scope and
The Halting Problems of Network Stack Insecurity
It is posited that by treating valid or expected inputs to programs and network protocol stacks as input languages that must be simple to parse the authors can immensely improve security, and that a system whose invalid inputs cannot be simply parsed cannot in practice be made secure.
Dijkstra's Rallying Cry for Generalization: The Advent of the Recursive Procedure, Late 1950s-Early 1960s
Some early contributions of Dijkstra are described by elaborating on his involvement in putting forward and implementing the recursive procedure as an ALGOL60 language construct and his generalizing style of solving problems.
Histories of Computing
This collection of essays and papers organized across three categories: historiography, software engineering, and theoretical computer science is of interest to computer professionals as well as historians of technology and science.