University of Zagreb. Faculty of Science. Department of Mathematics.
Abstract
U ovom radu demonstrirali smo razvoj formalnih koncepata računalnih virusa. Prvo poglavlje daje pregled von Neumannovih staničnih automata koji su sadržavali sve alate kojima se računalni virus mogao definirati i izgraditi. Prvim dijelom drugog poglavlja predstavljamo osnovne rezultate doktorske disertacije Fredericka Cohena koji stvarno započinje razvoj ove teorije. Svakako najvažniji rezultat koji smo dali onaj je koji govori o neodlučivosti virusnog skupa, odnosno virusa. Konačno, drugim dijelom drugog poglavlja otkrivamo način na koji Cohenov mentor, Leonard Adleman, poopćuje teoriju koristeći se rekurzivnim funkcijama.In this thesis we have presented formalization of the basic concepts of computer viruses. First chapter deals with von Neumann’s cellular automata, which were in themselves sufficient for the definition of a virus and its construction. In the first part of the second chapter we give some of the results Frederick Cohen proved in his PhD thesis. It was Cohen who actually began the development of this theory. The fundamental result of this theory is undecidability of a viral set, that is the undecidability of a virus. Finally, in the second part of the second chapter we present how Cohen’s PhD supervisor, Leonard Adleman, generalized this theory by using recursive functions
