On complexity of colloid cellular automata

Abstract

Abstract The colloid cellular automata do not imitate the physical structure of colloids but are governed by logical functions derived from them. We analyze the space-time complexity of Boolean circuits derived from the electrical responses of colloids-specifically ZnO (zinc oxide, an inorganic compound also known as calamine or zinc white, which naturally occurs as the mineral zincite), proteinoids (microspheres and crystals of thermal abiotic proteins), and their combinations in response to electrical stimulation. To extract Boolean circuits from colloids, we send all possible configurations of two-, four-, and eight-bit binary strings, encoded as electrical potential values, to the colloids, record their responses, and infer the Boolean functions they implement. We map the discovered functions onto the cell-state transition rules of cellular automata-arrays of binary state machines that update their states synchronously according to the same rule-creating the colloid cellular automata. We then analyze the phenomenology of the space-time configurations of the automata and evaluate their complexity using measures such as compressibility, Shannon entropy, Simpson diversity, and expressivity. A hierarchy of phenomenological and measurable space-time complexity is constructed.

Keywords

• Cellular automata
• Unconventional computing
• Colloids
• Liquid computers