DNA is the genetic material of all living things, except for viruses, most of which have genomes that are RNA – not DNA. Further, the majority of viral RNA genomes are single stranded (ss) rather than duplex chains. The simplest of these ssRNA viruses, whether infecting bacteria, plants, or animals, involve a single copy of their genome, protected (“packaged”) by a single-molecule-thick spheric...

This paper argues that Haigh and Young’s definition of noninterference for intransitive security policies admits information flows that are not in accordance with the intuitions it seeks to formalise. Several alternative definitions are discussed, which are shown to be equivalent to the classical definition of noninterference with respect to transitive policies. Rushby’s unwinding conditions fo...

Although Broadbent concedes that we are probably correct in supposing that memory representations are distributed, he argues that psychological evidence is irrelevant to our argument because our point is relevant only at what Marr (1982) has called the implementation^ level of description and that psychological theory is only properly concerned with what Marr calls the computational level. We b...

We demonstrate that also the second sum involved in Apéry’s proof of the irrationality of ζ(3) becomes trivial by symbolic summation. In his beautiful survey [4], van der Poorten explained that Apéry’s proof [1] of the irrationality of ζ(3) relies on the following fact: If a(n) = n

This note presents a detailed proof of a result in the theory of concurrency semantics that is already considered folklore, namely that branching bisimilarity is an equivalence relation. The \simple proof," which in the literature is always assumed to exist, is shown to be incorrect. The proof in this note is based on the notion of a semi-branching bisimulation taken from [10]. Branching bisimi...

Slot and van Emde Boas’ weak invariance thesis states that reasonable machines can simulate each other within a polynomial overhead in time. Is λ-calculus a reasonable machine? Is there a way to measure the computational complexity of a λ-term? This paper presents the first complete positive answer to this long-standing problem. Moreover, our answer is completely machine-independent and based o...