Re:Columbia Engineering Team Builds First Hacker-Resistant C...
by duckfang on Tuesday May 25, 2021 @04:04PM
(#27281898)
I work in this area. And yes, for any function that does malware, there's an infinity of similar functions that do the same. And you cannot catch them all.
What you typed is good for an academic setting, in the "wellactually technical correct" sense of the term.
No, it does not. Turing-completeness simply means that for certain properties which could be true or false about some software (like whether it halts), given an arbitrary piece of software, you won't always know whether or not it satisfies the property. It does not prevent you from assuming "No" in the cases where you don't know. Nor does it prevent there from being other properties (e.g., ability to access another user's data) for which the answer is always no.