Advertisement

Reversibility and Universality

Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday

  • Andrew Adamatzky

Part of the Emergence, Complexity and Computation book series (ECC, volume 30)

Table of contents

  1. Front Matter
    Pages i-xii
  2. Kenichi Morita
    Pages 1-3
  3. Klaus Sutner
    Pages 37-59
  4. Martin Kutrib, Andreas Malcher
    Pages 129-168
  5. Georgios Ch. Sirakoulis, Ioannis Karafyllidis
    Pages 183-198
  6. Genaro J. Martínez, Andrew Adamatzky, Kenichi Morita
    Pages 199-220
  7. Teijiro Isokawa, Ferdinand Peper
    Pages 221-241
  8. Yuhi Ohkubo, Tetsuo Yokoyama, Chishun Kanayama
    Pages 243-267
  9. Katsunobu Imai, Bruno Martin, Ryohei Saito
    Pages 269-277
  10. Ferdinand Peper, Jia Lee
    Pages 299-311
  11. K. G. Subramanian, Sastha Sriram, Bosheng Song, Linqiang Pan
    Pages 333-356
  12. Oscar H. Ibarra, Ian McQuillan
    Pages 357-372
  13. Masami Hagiya, Katsunobu Imai
    Pages 373-383
  14. Martin Kutrib, Andreas Malcher, Matthias Wendlandt
    Pages 385-431
  15. Artiom Alhazov, Sergey Verlan, Rudolf Freund
    Pages 433-446
  16. Guoliang Xu, Daowen Qiu, Xiangfu Zou, Jozef Gruska
    Pages 447-462
  17. Back Matter
    Pages 481-484

About this book

Introduction

This 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, reversible simulations of ranking trees, Shor’s factorization algorithms, and power consumption of cellular automata.

Keywords

Reversibility Universality Mathematical Machines Theory of Computation Logig Cellular Automata Turing Machine

Editors and affiliations

  • Andrew Adamatzky
    • 1
  1. 1.Unconventional Computing CentreUniversity of the West of EnglandBristolUnited Kingdom

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-73216-9
  • Copyright Information Springer International Publishing AG 2018
  • Publisher Name Springer, Cham
  • eBook Packages Engineering
  • Print ISBN 978-3-319-73215-2
  • Online ISBN 978-3-319-73216-9
  • Series Print ISSN 2194-7287
  • Series Online ISSN 2194-7295
  • Buy this book on publisher's site