SOMMARIO/ABSTRACT Preferences typically define a partial ordering over outcomes. A number of formalisms like soft constraints and CP-nets exists to specify such partial or-derings. In situations involving multiple agents, we need to combine the preferences of several individuals. In this paper, we consider each agent as voting on whether they prefer one outcome to another. We prove that, under ...

We show that unitarity does not allow cloning of any two points in a ray. This has implication for cloning of the geometric phase information in a quantum state. In particular, the quantum history which is encoded in the geometric phase during cyclic evolution of a quantum system cannot be copied. We also prove that the generalized geometric phase information cannot be copied by a unitary opera...

In this paper we consider three potential simplifications to a result of Solovay’s concerning the Turing degrees of nonstandard models of arbitrary completions of first-order Peano Arithmetic (PA). Solovay characterized the degrees of nonstandard models of completions T of PA, showing that they are the degrees of sets X such that there is an enumeration R ≤T X of an “appropriate” Scott set and ...

The background to these notes is the expectation that mathematical modelling and simulation is going to play increasingly important role in the understanding of the organization and control of genetic-, metabolic-, and signalling pathways. I am going to argue that for modelling and simulation to help our understanding of cellular dynamics, the current practice of experimental design has to chan...

We investigate expressiveness of a fragment of the ambient calculus, a formalism for describing distributed and mobile computations. More precisely, we study expressiveness of the pure and public ambient calculus from which the capability has been removed, in terms of the reachability problem of the reduction relation. Surprisingly, we show that even for this very restricted fragment, the reach...