Real Linear Automata with a Continuum of Periodic Solutions for Every Period

Interesting dynamical features such as periodic solutions of binary cellular automata are rare and therefore difficult to find, in general. In this paper, we illustrate an effective method in identifying fixed and periodic points of traditional one- and two-dimensional p p-valued cellular automaton systems, using cycle graphs. We also show that when the binary or p p-valued cellular states are extended to real-values and when defined as doubly-infinite vectors, there exists a continuum of periodic solutions for every period, even when the governing local rules are simply linear. In addition, we demonstrate the important effect that boundary conditions have on systems’ dynamical structures

Layered Cellular Automata

Layered Cellular Automata (LCA) extends the concept of traditional cellular automata (CA) to model complex systems and phenomena. In LCA, each cell's next state is determined by the interaction of two layers of computation, allowing for more dynamic and realistic simulations. This thesis explores the design, dynamics, and applications of LCA, with a focus on its potential in pattern recognition and classification. The research begins by introducing the limitations of traditional CA in capturing the complexity of real-world systems. It then presents the concept of LCA, where layer 0 corresponds to a predefined model, and layer 1 represents the proposed model with additional influence. The interlayer rules, denoted as f and g, enable interactions not only from adjacent neighboring cells but also from some far-away neighboring cells, capturing long-range dependencies. The thesis explores various LCA models, including those based on averaging, maximization, minimization, and modified ECA neighborhoods. Additionally, the implementation of LCA on the 2-D cellular automaton Game of Life is discussed, showcasing intriguing patterns and behaviors. Through extensive experiments, the dynamics of different LCA models are analyzed, revealing their sensitivity to rule changes and block size variations. Convergent LCAs, which converge to fixed points from any initial configuration, are identified and used to design a two-class pattern classifier. Comparative evaluations demonstrate the competitive performance of the LCA-based classifier against existing algorithms. Theoretical analysis of LCA properties contributes to a deeper understanding of its computational capabilities and behaviors. The research also suggests potential future directions, such as exploring advanced LCA models, higher-dimensional simulations, and hybrid approaches integrating LCA with other computational models.Comment: This thesis represents the culmination of my M.Tech research, conducted under the guidance of Dr. Sukanta Das, Associate Professor at the Department of Information Technology, Indian Institute of Engineering Science and Technology, Shibpur, West Bengal, India. arXiv admin note: substantial text overlap with arXiv:2210.13971 by other author

Problems

I. Definition of the Subject and Its Importanc

www.springerreference.com/docs/html/chapterdbid/60497.html Mechanical Computing: The Computational Complexity of Physical Devices

- Mechanism: A machine or part of a machine that performs a particular task computation: the use of a computer for calculation.- Computable: Capable of being worked out by calculation, especially using a computer.- Simulation: Used to denote both the modeling of a physical system by a computer as well as the modeling of the operation of a computer by a mechanical system; the difference will be clear from the context. Definition of the Subject Mechanical devices for computation appear to be largely displaced by the widespread use of microprocessor-based computers that are pervading almost all aspects of our lives. Nevertheless, mechanical devices for computation are of interest for at least three reasons: (a) Historical: The use of mechanical devices for computation is of central importance in the historical study of technologies, with a history dating back thousands of years and with surprising applications even in relatively recent times. (b) Technical & Practical: The use of mechanical devices for computation persists and has not yet been completely displaced by widespread use of microprocessor-based computers. Mechanical computers have found applications in various emerging technologies at the micro-scale that combine mechanical functions with computational and control functions not feasible by purely electronic processing. Mechanical computers also have been demonstrated at the molecular scale, and may also provide unique capabilities at that scale. The physical designs for these modern micro and molecular-scale mechanical computers may be based on the prior designs of the large-scale mechanical computers constructed in the past. (c) Impact of Physical Assumptions on Complexity of Motion Planning, Design, and Simulation: The study of computation done by mechanical devices is also of central importance in providing lower bounds on the computational resources such as time and/or space required to simulate a mechanical syste

Cellular Automata

Modelling and simulation are disciplines of major importance for science and engineering. There is no science without models, and simulation has nowadays become a very useful tool, sometimes unavoidable, for development of both science and engineering. The main attractive feature of cellular automata is that, in spite of their conceptual simplicity which allows an easiness of implementation for computer simulation, as a detailed and complete mathematical analysis in principle, they are able to exhibit a wide variety of amazingly complex behaviour. This feature of cellular automata has attracted the researchers' attention from a wide variety of divergent fields of the exact disciplines of science and engineering, but also of the social sciences, and sometimes beyond. The collective complex behaviour of numerous systems, which emerge from the interaction of a multitude of simple individuals, is being conveniently modelled and simulated with cellular automata for very different purposes. In this book, a number of innovative applications of cellular automata models in the fields of Quantum Computing, Materials Science, Cryptography and Coding, and Robotics and Image Processing are presented

Perspective on Reversible to Irreversible Transitions in Periodic Driven Many Body Systems and Future Directions For Classical and Quantum Systems

Reversible to irreversible (R-IR) transitions arise in numerous periodically driven collectively interacting systems that, after a certain number of driving cycles, organize into a reversible state where the particle trajectories repeat, or remain irreversible with chaotic motion. R-IR transitions were first systematically studied for periodically sheared dilute colloids, and appear in a wide variety of both soft and hard matter systems, including amorphous solids, crystals, vortices in type-II superconductors, and magnetic textures. In some cases, the reversible transition is an absorbing phase transition with a critical divergence in the organization time scale. R-IR systems can store multiple memories and exhibit return point memory. We give an overview of R-IR transitions including recent advances in the field, and discuss how the general framework of R-IR transitions could be applied to a much broader class of periodically driven nonequilibrium systems, including soft and hard condensed matter systems, astrophysics, biological systems, and social systems. Some likely candidate systems are commensurate-incommensurate states, systems exhibiting hysteresis or avalanches, and nonequilibrium pattern forming states. Periodic driving could be applied to hard condensed matter systems to see if R-IR transitions occur in metal-insulator transitions, semiconductors, electron glasses, electron nematics, cold atom systems, or Bose-Einstein condensates. R-IR transitions could also be examined in dynamical systems where synchronization or phase locking occurs. We discuss the use of complex periodic driving such as changing drive directions or multiple frequencies as a method to retain complex multiple memories. Finally, we describe features of classical and quantum time crystals that could suggest the occurrence of R-IR transitions in these systems.Comment: 25 pages, 27 figure