株式会社極東書店トップ ＞ 商品一覧 ＞ Reversibility and Universality: Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday. 2018 ed.
商品詳細
Reversibility and Universality: Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday. 2018 ed.
・ISBN 978-3-319-73215-2 hard EUR 99.99
￥26,726.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
| 著者・編者 | Adamatzky, Andrew (ed.), |
|---|---|
| シリーズ | (Emergence, Complexity and Computation) |
| 出版社 | (Springer International Publishing AG, SZ) |
| 出版年月 | 2018 |
| ページ数 | 484 pp. |
| 言語 | ENG |
| ニュース番号 | ＜A02-71722＞ |
解説
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, reversiblesimulations of ranking trees, Shor's factorization algorithms, and power consumption of cellular automata.