Georgios Ch. Sirakoulis – författare

Modern computing relies on future and emergent technologies which have been conceived via interaction between computer science, engineering, chemistry, physics and biology. This highly interdisciplinary book presents advances in the fields of parallel, distributed and emergent information processing and computation. The book represents major breakthroughs in parallel quantum protocols, elastic cloud servers, structural properties of interconnection networks, internet of things, morphogenetic collective systems, swarm intelligence and cellular automata, unconventionality in parallel computation, algorithmic information dynamics, localized DNA computation, graph-based cryptography, slime mold inspired nano-electronics and cytoskeleton computers.

Features

From Parallel to Emergent Computing provides a visionary statement on how computing will advance in the next 25 years and what new fields of science will be involved in computing engineering. This book is a valuable resource for computer scientists working today, and in years to come.

Modern computing relies on future and emergent technologies which have been conceived via interaction between computer science, engineering, chemistry, physics and biology. This highly interdisciplinary book presents advances in the fields of parallel, distributed and emergent information processing and computation. The book represents major breakthroughs in parallel quantum protocols, elastic cloud servers, structural properties of interconnection networks, internet of things, morphogenetic collective systems, swarm intelligence and cellular automata, unconventionality in parallel computation, algorithmic information dynamics, localized DNA computation, graph-based cryptography, slime mold inspired nano-electronics and cytoskeleton computers.

Features

From Parallel to Emergent Computing provides a visionary statement on how computing will advance in the next 25 years and what new fields of science will be involved in computing engineering. This book is a valuable resource for computer scientists working today, and in years to come.

This book constitutes the refereed proceedings of the 14th International Conference on Cellular Automata for Research and Industry, ACRI 2020, which took place in Lodz, Poland, during December 2-4, 2020.

The 24 full and 3 short papers presented in this volume were carefully reviewed and selected from 40 submissions. They were organized in topical sections named: theory and cryptography, modeling and simulation, and disease spreading dynamics.

This book embarks on a journey through the captivating universe of cellular automata and discover its distinct realm, characterised by discrete time, space, and states, where cells form regular patterns and offer insights into complex systems across various domains. From theoretical foundations to practical applications, each chapter unveils innovative ideas and implementations, from solving initial value problems to exploring reversible computing and real-time pattern generation. Explore hyperbolic spaces, analyse elementary automata, and delve into network growth dynamics. Shedding light on synchronisation, control, and computational structures, this book is an invaluable resource for computer scientists, modellers, mathematicians, engineers, physicists, and professionals across disciplines. Immerse yourself in the intricate complexities and boundless potential of cellular automata, whether unravelling pedestrian dynamics or exploring cryptographic applications.

This book embarks on a journey through the captivating universe of cellular automata and discover its distinct realm, characterised by discrete time, space, and states, where cells form regular patterns and offer insights into complex systems across various domains. From theoretical foundations to practical applications, each chapter unveils innovative ideas and implementations, from solving initial value problems to exploring reversible computing and real-time pattern generation. Explore hyperbolic spaces, analyse elementary automata, and delve into network growth dynamics. Shedding light on synchronisation, control, and computational structures, this book is an invaluable resource for computer scientists, modellers, mathematicians, engineers, physicists, and professionals across disciplines. Immerse yourself in the intricate complexities and boundless potential of cellular automata, whether unravelling pedestrian dynamics or exploring cryptographic applications.

The book gives a comprehensive overview of the state-of-the-art research and engineering in theory and application of Lattice Automata in design and control of autonomous Robots. Automata and robots share the same notional meaning. Automata (originated from the latinization of the Greek word “αυτόματον”) as self-operating autonomous machines invented from ancient years can be easily considered the first steps of robotic-like efforts. Automata are mathematical models of Robots and also they are integral parts of robotic control systems. A Lattice Automaton is a regular array or a collective of finite state machines, or automata. The Automata update their states by the same rules depending on states of their immediate neighbours.

In the context of this book, Lattice Automata are used in developing modular reconfigurable robotic systems, path planning and map exploration for robots, as robot controllers, synchronisation of robot collectives, robot vision, parallel robotic actuators. All chapters are written in an accessible manner and lavishly illustrated. The book will help computer and robotic scientists and engineers to understand mechanisms of decentralised functioning of robotic collectives and to design future and emergent reconfigurable, parallel and distributed robotic systems.

The book gives a comprehensive overview of the state-of-the-art research and engineering in theory and application of Lattice Automata in design and control of autonomous Robots. Automata and robots share the same notional meaning. Automata (originated from the latinization of the Greek word "αυτόματον") as self-operating autonomous machines invented from ancient years can be easily considered the first steps of robotic-like efforts. Automata are mathematical models of Robots and also they are integral parts of robotic control systems. A Lattice Automaton is a regular array or a collective of finite state machines, or automata. The Automata update their states by the same rules depending on states of their immediate neighbours.

In the context of this book, Lattice Automata are used in developing modular reconfigurable robotic systems, path planning and map exploration for robots, as robot controllers, synchronisation of robot collectives, robot vision, parallel robotic actuators. All chapters are written in an accessible manner and lavishly illustrated. The book will help computer and robotic scientists and engineers to understand mechanisms of decentralised functioning of robotic collectives and to design future and emergent reconfigurable, parallel and distributed robotic systems.

This Handbook presents all aspects of memristor networks in an easy to read and tutorial style. Including many colour illustrations, it covers the foundations of memristor theory and applications, the technology of memristive devices, revised models of the Hodgkin-Huxley Equations and ion channels, neuromorphic architectures, and analyses of the dynamic behaviour of memristive networks. It also shows how to realise computing devices, non-von Neumann architectures and provides future building blocks for deep learning hardware.

With contributions from leaders in computer science, mathematics, electronics, physics, material science and engineering, the book offers an indispensable source of information and an inspiring reference text for future generations of computer scientists, mathematicians, physicists, material scientists and engineers working in this dynamic field.