One of the roots of evolutionary computation was the idea of Turing about unorganized machines. The goal of this paper is the development of foundations for evolutionary computations, connecting Turing’s ideas and the contemporary state of art in evolutionary computations. The theory of computation is based on mathematical models of computing automata, such as Turing machines or finite automata...

With the advent of the next generation java servlet on the smartcard, the Future Internet will be composed by web servers and clients silently yet busily running on high end smart cards in our phones and our wallets. In this new world model we can no longer accept the current security model where programs can be downloaded on our machines just because they are vaguely “trusted”. We want to know...

1. Diagonalization: The Halting problem is defined as follows: Given a TuringMachineM = 〈Q, {0, 1},Γ, δ, q0,2, F 〉 and a string w ∈ Σ∗, determine whether M halts on w. In class, we proved that the Halting problem is undecidable using two different techniques. The first technique was constructive, where we constructed a series of Turing Machines, which led to a contradiction. The second techniqu...

Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction principle for verifying invariance, a theory for verifying stability or convergence of automata is currently not available. In this paper, we formalize one such theory proposed by Tsitsiklis [25]. We build on the existing PVS metatheory for untimed, timed, and hybrid in...

To combat the increasing significance of deployment and configuration costs, the concept of a self-deploying, self-configuring radio access network is discussed. It is proposed that the basic sciences of complex systems (cellular automata, game theory, ecology modeling) can be exploited to design algorithms for such a system. An example, taken from the field of cellular automata, is presented f...

We study two-way tree automata modulo equational theories. We deal with the theories of Abelian groups (ACUM ), idempotent commutative monoids (ACUI), and the theory of exclusive-or (ACUX), as well as some variants including the theory of commutative monoids (ACU ). We show that the one-way automata for all these theories are closed under union and intersection, and emptiness is decidable. For ...