Related papers: Complexity of Langton's Ant
The model of cellular automata is fascinating because very simple local rules can generate complex global behaviors. The relationship between local and global function is subject of many studies. We tackle this question by using results on…
There is great potential if we understand how nature functions, particularly the animals taking down from the ant to the larger animals. In this paper we will make an attempt to learn about ants colonization processing by studying their…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Entanglement is the defining characteristic of quantum mechanics. Bipartite entanglement is characterized by the von Neumann entropy. Entanglement is not just described by a number, however; it is also characterized by its level of…
Topological quantum many-body systems, such as Hall insulators, are characterized by a hidden order encoded in the entanglement between their constituents. Entanglement entropy, an experimentally accessible single number that globally…
Characterizing the quantum complexity of local random quantum circuits is a very deep problem with implications to the seemingly disparate fields of quantum information theory, quantum many-body physics and high energy physics. While our…
Ant-based algorithms are successful tools for solving complex problems. One of these problems is the Linear Ordering Problem (LOP). The paper shows new results on some LOP instances, using Ant Colony System (ACS) and the Step-Back Sensitive…
A few of ant robots are dropped to a labirynth, formed by a square lattice with a small number of nodes removed. Ants move according to a deterministic algorithm designed to explore all corridors. Each ant remembers the shape of corridors…
In the present paper, we describe new approaches for constructing virtual knot invariants. The main background of this paper comes from formulating and bringing together the ideas of biquandle (Kauffman and Radford) the virtual quandle…
With the increasing demand and complexity of networks, factors such as balancing the load, improving the performance, reducing delay and finding optimal path between nodes in a computer network have become crucial. The traditional routing…
Entanglement, a defining property of quantum mechanics in which two physical subsystems cannot be seen as independent entities, challenges our everyday experience and classical intuition. However, only such strong quantum correlations…
A caveat to many applications of the current Deep Learning approach is the need for large-scale data. One improvement suggested by Kolmogorov Complexity results is to apply the minimum description length principle with computationally…
The emergence of complex behaviors in cellular automata is an area that has been widely developed in recent years with the intention to generate and analyze automata that produce space-moving patterns or gliders that interact in a periodic…
We discuss a characterization of complexity based on successive approximations of the probability density describing a system by means of maximum entropy methods, thereby quantifying the respective role played by different orders of…
Reproduction, development, and individual interactions are essential topics in artificial life. The cellular automata, which can handle these in a composite way, is highly restricted in its form and behavior because it represents life as a…
We introduce the zeta number, natural halting probability and natural complexity of a Turing machine and we relate them to Chaitin's Omega number, halting probability, and program-size complexity. A classification of Turing machines…
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state of the central cell will follow a given evolution, by…
The theory of computational complexity focuses on functions and, hence, studies programs whose interactive behavior is reduced to a simple question/answer pattern. We propose a broader theory whose ultimate goal is expressing and analyzing…
Many insects like ants communicate chemically via chemotaxis. This allows them to build large trail systems which in many respects are similar to human-build highway networks. Using a recently proposed stochastic cellular automaton model we…
Motivated by recent experimental work of Burd et al., we propose a model of bi-directional ant-traffic on pre-existing ant-trails. It captures in a simple way some of the generic collective features of movements of real ants on a trail.…