Timeline for Has it been mathematically proven that antivirus can't detect all viruses?
Current License: CC BY-SA 4.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 26, 2019 at 17:35 | comment | added | user64742 | @BlueRaja-DannyPflughoeft the church turing thesis states that the human mind is equivalent to a turing machine. That has no basis on whether or not a hypercomputer is possible to construct. All it means is that we wouldn't be able to do the calculations by hand. We'd have to rely on the machine being correct. How does that article at all back up that claim? | |
Jan 25, 2019 at 22:57 | comment | added | BlueRaja - Danny Pflughoeft | @HarryJohnston: Quantum computers are equivalent to Turing Machines in terms of computability, so no, it doesn't need to be redone. In fact, pretty much every computer scientist believes that every physically-realizable computer is, at best, equivalent to a Turing Machine | |
Jan 25, 2019 at 8:52 | comment | added | Philipp | This answer heavily relies on an external link to answer the question. Can you maybe sumarize the arguments from that paper? | |
Jan 24, 2019 at 20:45 | comment | added | Harry Johnston | @user1067003, I'm not a computer scientist, but I'm pretty sure the phrase "there is no algorithm" means that there is no possible algorithm, not just that there is no known algorithm. Otherwise it would not be a very interesting result. (The proof as written probably only applies to classical computers though, it might need to be redone to cover quantum computers or any other more abstruse architectures.) | |
Jan 24, 2019 at 15:11 | comment | added | user1067003 | so it was proven that in 1987, the perfect antivirus did not exist? neat. but did he also prove that the perfect antivirus could not be created, or merely that it didn't exist as of 1987? | |
Jan 23, 2019 at 16:47 | comment | added | Joshua | @Stephan: For every possible binary there exists a hypothetical platform for which it is virulent and a hypothetical platform for which it is not virulent. This theorem is stronger than Rice's theorem as it applies to hypercomputers also. | |
Jan 23, 2019 at 11:31 | comment | added | Steve Jessop | Schneier states here that this is the result he was referring to when he made a very similar statement some time later in another context: schneier.com/blog/archives/2009/07/making_an_opera.html | |
Jan 23, 2019 at 6:20 | history | answered | Harry Johnston | CC BY-SA 4.0 |