Free Delivery Over $100
|
|
|||
|
||||
OverviewThis book is a tribute to Kenichi Morita’s ideas and achievements in theoretical computer science, reversibility and computationally universal mathematical machines. It offers a unique source of information on universality and reversibility in computation and is an indispensable book for computer scientists, mathematicians, physicists and engineers. Morita is renowned for his works on two-dimensional language accepting automata, complexity of Turing machines, universality of cellular automata, regular and context-free array grammars, and undecidability. His high-impact works include findings on parallel generation and parsing of array languages by means of reversible automata, construction of a reversible automaton from Fredkin gates, solving a firing squad synchronization problem in reversible cellular automata, self-reproduction in reversible cellular spaces, universal reversible two-counter machines, solution of nondeterministic polynomial (NP) problems in hyperbolic cellular automata, reversible P-systems, a new universal reversible logic element with memory, and reversibility in asynchronous cellular automata. Kenichi Morita’s achievements in reversibility, universality and theory of computation are celebrated in over twenty high-profile contributions from his colleagues, collaborators, students and friends. The theoretical constructs presented in this book are amazing in their diversity and depth of intellectual insight, addressing: queue automata, hyperbolic cellular automata, Abelian invertible automata, number-conserving cellular automata, Brownian circuits, chemical automata, logical gates implemented via glider collisions, computation in swarm networks, picture arrays, universal reversible counter machines, input-position-restricted models of language acceptors, descriptional complexity and persistence of cellular automata, partitioned cellular automata, firing squad synchronization algorithms, reversible asynchronous automata, reversiblesimulations of ranking trees, Shor’s factorization algorithms, and power consumption of cellular automata. Full Product DetailsAuthor: Andrew AdamatzkyPublisher: Springer Nature Switzerland AG Imprint: Springer Nature Switzerland AG Edition: Softcover reprint of the original 1st ed. 2018 Volume: 30 Dimensions: Width: 15.50cm , Height: 2.50cm , Length: 23.50cm Weight: 0.753kg ISBN: 9783030103347ISBN 10: 303010334 Pages: 484 Publication Date: 04 January 2019 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand  We will order this item for you from a manufactured on demand supplier. Table of ContentsA Snapshot of My Life.- FSSP Algorithms for 2D Rectangular Arrays. Recent Developments.- Abelian Invertible Automata.- Simulation and Intrinsic Universality Among Reversibility Cellular Automata, the Partition Cellular Automata Leverage.- A Weakly Universal Cellular Automaton on the Grid {8,3} with Two States.- Invertible Construction of Decimal-to-Dinary Converter Using Reversible Elements.- Power Consumption in Cellular Automata.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
