A number of evolutionary models based on the iterated Prisoner's Dilemma with noise are discussed. Different aspects of the evolutionary behaviour are illustrated (i) by varying the trickiness of the game (iterated game, mistakes, misunderstandings, choice of payoff matrix), (ii) by introducing...

We show that predicting the HPP or FHP III lattice gas for finite time is equivalent to calculating the output of an arbitrary Boolean circuit, and is therefore P-complete: that is, it is just as hard as any other problem solvable by a serial computer in polynomial time. <p> It is widely believed...</p>

In dynamical systems such as cellular automata and iterated maps, it is often useful to look at a {\it language} or set of symbol sequences produced by the system. There are well-established classification schemes, such as the Chomsky hierarchy, with which we can measure the complexity of these...

A framework for studying the evolution of cooperative behaviour, using evolution of finite state strategies, is presented. The interaction between agents is modelled by a repeated game with random observable payoffs. The agents are thus faced with a more complex (and general) situation, compared...