Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
An Abstract Theory of Computer Viruses
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
A Classification of Viruses Through Recursion Theorems
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
On the time complexity of computer viruses
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
It is well known that there exist viruses whose set of infected programs is undecidable. If a virus detector is to err on the side of caution with respect to such a virus, then it must label some perfectly innocent programs as being infected by the virus. Can there exist a virus whose set of infected programs is so unwieldy that any cautious virus detector must label all but finitely many programs as being infected by the virus â聙聰 even when infinitely many programs are not infected by the virus? Although such viruses can exist, strong theoretical evidence is presented that such a virus is unlikely to be encountered in the real world. Several of our proofs employ infinitary self-reference arguments