Online Sales Inquiries
Current partners can send an email to firstname.lastname@example.org for any support
issues or contact your account manager.
Alan Turing, Undecidable Problems, and Malware
Alan Turing proved in 1936 that a general algorithm (software code) running on a Turing machine that solves the halting problem for all possible program-input pairs necessarily cannot exist.
On the Impossibility of Virus Detection
Professor Dave Evans, Computer Science Dept., University of Virginia
Why is computer security so hard? The Halting Problem proves detection-based security solutions can never be 100 percent effective. Read Computer Science Professor Dave Evan’s essay to see how redefining our problems and approaches mathematically can help us find new solutions such as “shadowing” (virtualization) to address the problem of malware.Read Publication