From Turing machines to computer viruses
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1810490 (Why is no real title available?)
- Computability of Recursive Functions
- Computational complexity of random access stored program machines
- Confusion of memory
- Creative sets
- Formal Reductions of the General Combinatorial Decision Problem
- Kleene's amazing second recursion theorem
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- On notation for ordinal numbers
- Periodicity in generations of automata
- Random-Access Stored-Program Machines, an Approach to Programming Languages
- The chemical basis of morphogenesis
- Time bounded random access machines
Cited in
(8)- Computing partial recursive functions by virus machines
- A Classification of Viruses Through Recursion Theorems
- The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian
- Theoretical computer science: computability, decidability and logic
- The foundations of computation, physics and mentality: the Turing legacy
- Paradoxical connectives: proof-theoretic semantics, recursion, and fixed-point operators
- Analysis and design of molecular machines
- Cloning automata: simulation and analysis of computer bacteria
This page was built for publication: From Turing machines to computer viruses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941590)