Automata Networks approach to TOE (Theory of Everything)

Research proposal from Dr. Mircea Andrecut

Objective: Every TOE must encompass two extremes, the fundamental laws of physics and the complex phenomena of a living system. Starting from Conway's Game of Life, the automata networks paradigm has constructed a model which could give an autonomous behavior to some artificial living systems, with a level of complexity close to the natural life. However, the local transition function (f) which governs evolution of the automata networks has no any connection with the laws of physics which are, nonetheless, the confining laws for natural life. Dr. Tienzen Gong's Prequark Theory finally links the quark theory of physics to Conway's Game of Life. This research program plans to construct a model for biological life system by using the automata networks approach while the dynamics of the system is governed by the laws of physics.

One, Starting points:

  1. Automata Networks Theory
  2. Quark Theory
  3. Prequark Theory

Two, scope of the project:

  1. Laws of self-organization
  2. Order-disorder transition
  3. Collective behaviors
  4. Chaotic behaviors
  5. Artificial life
  6. Quantum computation
  7. Quark theory
  8. Prequark theory

Three, expected results:

  1. A generalization of Conway's Game of Life
  2. A connection between biological (artificial) living system and automata networks
  3. A connection between automata networks and Prequark Theory

Four, epistemology of automata networks --- the validity of any result from automata networks approach is based on two steps:

  1. The foundation, V(0) -- the validity of the foundation of automata networks approach is based on mathematical models and demonstrated by Von Bertalanffy, Corning, Prigogine and others.
  2. The evolution --- the first generation of an automata networks, A(1) is validated with V(0); then, V(0) + A(1) becomes V(1). The validity of subsequent generations, A(n), are obtained with the interplay of two processes.

Five, this work will be published in:

Key Words:

  1. Automata networks: are modeled by cells and interaction rules, are indefinitely extended networks of trivially small, identical, uniformly interconnected, and synchronously clocked digital computers. From the mathematical point of view, automata networks are given by a tuple (C, N, Q, f), where C is the cellular space, N is the neighborhood, Q is the set of cell states and f is the local transition function which associates a new state to each cell, depending on the cell state itself and the each state configuration in the neighborhood. The dynamics of the automata networks is given by the synchronous application of the local function, f, to all the cells in the cellular space.
  2. Automata networks paradigm: is developed on basis of two important principles: It encompasses the following disciplines: Self-organization, order-disorder transition, collective behaviors, chaotic behaviors, far from thermodynamic equilibrium, artificial intelligence, artificial life, quantum computation. It represents the expression of the profound similarities between the fundamental mathematical models, which are used to describe the cooperative behavior of active systems in physics, chemistry, biology and social sciences.

Dr. Andrecut's papers published on the WWW (Internet)

  1. Logistic map, an ideal random number generator
  2. On the ergodic behavior of a thermostated harmonic oscillator
  3. Parallel computation in the game of life (and other cellular automata)
  4. Biomorphs, computing biological shapes

[back]