Collision-Based Computing

Abstract

Collision-based computing is an implementation of logical circuits, mathematical machines or other computing and information processing devices in homogeneous uniform unstructured media with traveling mobile localizations. A quanta of information is represented by a compact propagating pattern (glider in cellular automata, soliton in optical system, wave-fragment in excitable chemical system). Logical truth corresponds to presence of the localization, logical false to absence of the localization; logical values can be also represented by a particular state of the localization. When two more or more traveling localizations collide they change their velocity vectors and/or states. Post-collision trajectories and/or states of the localizations represent results of a logical operations implemented by the collision. One of the principle advantages of the a collision-based computing medium-hidden in 1D systems but obvious in 2D and 3D media-is that the medium is architecture-less: nothing is hardwired, there are no stationary wires or gates, a trajectory of a propagating information quanta can be see as a momentary wire. We introduce basics of collision-based computing, and overview the collision-based computing schemes in 1D and 2D cellular automata and continuous excitable media. Also we provide an overview of collision-based schemes where particles/collisions are dimensionless.

Strict Proof of the Perfection of the First 98 Masks (Solution to the “X-Problem of the Number 3”)

“…This kind of Fredkin's Automaton will be a subject of following discussions because exactly this kind of Fredkin Automaton demonstrates, rather than any other Fredkin's Automata, a completely surprising and paradoxical behavior [6]. All other FA (and that can be shown) "deteriorate" over time.…”

Designing the Unexpected

“…Conway's Game of Life [7] employs three simple rules governing whether cells in a grid live, reproduce or die based on their local neighborhood and is able to produce extremely complex behaviors up to and including an operational Turing machine [1]. Boids [22] use three simple rules for separation, alignment, and cohesion to reproduce the realistic group movements of flocks and herds; this technique is widely used in the animation industry [21] and has been expanded upon to create interactive art [3].…”

“…Rose's character has i=(. 5,3) and c= (1,4). If Rose's neutral behavior finishes its animation, her emotional state will be recalculated with:…”

“…In this paper, we focus on the latter-sustaining interest-with the overarching goal of creating endlessly fascinating interaction (EFI). Our focus on EFI frames our goal to provide observable actions that: (1) are interesting at any time; (2) are not repetitive; and (3) offer unfolding actions in which story lines are emergent. Also, we explore passive interaction, which offers the possibility of providing continual variation without requiring people to take actions beyond what they would normally do when viewing an installation.…”

Abstract geometrical computation 7: geometrical accumulations and computably enumerable real numbers

“…Geometrically, it is related to the "colored spaces" or "Mondrian spaces" of Jacopini and Sontacchi (1990) which involves polyhedra in Euclidean spaces with a distinguished direction for time. It can also be understood as an idealization of collision computing (Adamatzky, 2002;Adamatzky and Durand-Lose, 2012).…”