Related papers: Complexity of Langton's Ant
We discuss some properties of a class of cellular automata sometimes called a "generalized ant". This system is perhaps most easily understood by thinking of an ant which moves about a lattice in the plane. At each vertex (or "cell"), the…
A modified version of Langton's ant is considered. The modified automaton is allowed to go straight $N$-th step instead of turning. The cell state, however, is changed as usually. Depending on the value of $N$ the automaton exhibits…
The automaton known as `Langton's ant' exhibits a dynamical transition from a disordered phase to an ordered phase where the particle dynamics (the ant) produces a regular periodic pattern (called `highway'). Despite the simplicity of its…
We perform intensive computations of Generalised Langton's Ants, discovering rules with a big number of highways. We depict the structure of some of them, formally proving that the number of highways which are possible for a given rule does…
The evolution of the Langton's ant on a 2D lattice is studied from the "ant's framework". The aim of this article is twofold. Firstly, to see if one can explain the emergent behaviour of the ant as an analogous sytem of a particle crossing…
We consider the problem of extracting accurate average ant trajectories from many (possibly inaccurate) input trajectories contributed by citizen scientists. Although there are many generic software tools for motion tracking and specific…
A Turmit is a Turing machine that works over a two-dimensional grid, that is, an agent that moves, reads and writes symbols over the cells of the grid. Its state is an arrow and, depending on the symbol that it reads, it turns to the left…
We propose a new probabilistic ant-based heuristic (ANTH-LS) for the longest simple cycle problem. This NP-hard problem has numerous real-world applications in complex networks, including efficient construction of graph layouts, analysis of…
Ant algorithms are inspired in real ants and the main idea is to create virtual ants that travel into the space of possible solution depositing virtual pheromone proportional to how good a specific solution is. This creates a autocatalytic…
The physical concept of quantum entanglement is brought to the biological domain. We simulate the cooperation of two insects by hypothesizing that they share a large number of quantum entangled spin-1/2 particles. Each of them makes…
An automata network (AN) is a finite graph where each node holds a state from a finite alphabet and is equipped with a local map defining the evolution of the state of the node depending on its neighbors. They are studied both from the…
The idea of sensitivity in ant colony systems has been exploited in hybrid ant-based models with promising results for many combinatorial optimization problems. Heterogeneity is induced in the ant population by endowing individual ants with…
We clarify and generalize the ant on a rubber rope paradox, which is a mathematical puzzle with a solution that appears counterintuitive. In this paper, we show that the ant can still reach the end of the rope even if we consider the step…
Using elementary distributed computing techniques we suggest an explanation for two unexplained phenomena in regards to ant colonies, (a) a substantial amount of ants in an ant colony are idle, and (b) the observed low survivability of new…
A recently proposed stochastic cellular automaton model ({\it J. Phys. A 35, L573 (2002)}), motivated by the motions of ants in a trail, is investigated in detail in this paper. The flux of ants in this model is sensitive to the probability…
Being able to objectively characterise the intrinsic complexity of behavioural patterns resulting from human or animal decisions is fundamental for deconvolving cognition and designing autonomous artificial intelligence systems. Yet…
The evolution of entanglement entropy in quantum circuits composed of Haar-random gates and projective measurements shows versatile behavior, with connections to phase transitions and complexity theory. We reformulate the problem in terms…
Inspired by Solomonoffs theory of inductive inference, we propose a prior based on circuit complexity. There are several advantages to this approach. First, it relies on a complexity measure that does not depend on the choice of UTM. There…
We use complexity theory to rigorously investigate the difficulty of classically simulating evolution under many-body localized (MBL) Hamiltonians. Using the defining feature that MBL systems have a complete set of quasilocal integrals of…
Why are living systems complex? Why does the biosphere contain living beings with complexity features beyond those of the simplest replicators? What kind of evolutionary pressures result in more complex life forms? These are key questions…