Arbitrary Code Execution in the Universal Turing Machine
This is oddly important. From the conclusion:<p>&gt; While this vulnerability has no real-world implications, we discuss whether it indicates an intrinsic propensityfor arbitrary code execution vulnerabilities in computers ingeneral.<p>As a joke in the 90&#x27;s I looked into writing malware for Napoleonic semaphore signalling networks (Chappe semaphore), with the idea that if it were possible, then nothing could be secure. We have some general ideas that nothing is secure, and that security is a relative quality and perception, but I don&#x27;t know that we&#x27;ve been able to formalize it into a conjecture. (Other than Hofstadter&#x27;s music to break phonographs by.)<p>Maybe I&#x27;m missing a big obvious one, but there&#x27;s something about programmable systems that they are necessarily unable to infer or deduce the output of a program beyond a certain complexity without first running it. Or maybe that there is a set of convolutions in a set of instructions whereafter the information it contains spirals off into chaos like the logistic equation and you can&#x27;t formally predict how a program behaves based on its initial state. There&#x27;s something about security problems that exist on the edge of computability and it seems like a perspective we could draw generalities from anyway.