000 04128nam a22005535i 4500
001 978-3-319-73216-9
003 DE-He213
005 20220801221525.0
007 cr nn 008mamaa
008 180226s2018 sz | s |||| 0|eng d
020 _a9783319732169
_9978-3-319-73216-9
024 7 _a10.1007/978-3-319-73216-9
_2doi
050 4 _aTA352-356
050 4 _aQC20.7.N6
072 7 _aTBJ
_2bicssc
072 7 _aGPFC
_2bicssc
072 7 _aTEC009000
_2bisacsh
072 7 _aTBJ
_2thema
072 7 _aGPFC
_2thema
082 0 4 _a515.39
_223
245 1 0 _aReversibility and Universality
_h[electronic resource] :
_bEssays Presented to Kenichi Morita on the Occasion of his 70th Birthday /
_cedited by Andrew Adamatzky.
250 _a1st ed. 2018.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2018.
300 _aXII, 484 p. 188 illus., 69 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aEmergence, Complexity and Computation,
_x2194-7295 ;
_v30
520 _aThis 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.
650 0 _aDynamics.
_956528
650 0 _aNonlinear theories.
_93339
650 0 _aComputational intelligence.
_97716
650 1 4 _aApplied Dynamical Systems.
_932005
650 2 4 _aComputational Intelligence.
_97716
700 1 _aAdamatzky, Andrew.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_956529
710 2 _aSpringerLink (Online service)
_956530
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319732152
776 0 8 _iPrinted edition:
_z9783319732176
776 0 8 _iPrinted edition:
_z9783030103347
830 0 _aEmergence, Complexity and Computation,
_x2194-7295 ;
_v30
_956531
856 4 0 _uhttps://doi.org/10.1007/978-3-319-73216-9
912 _aZDB-2-ENG
912 _aZDB-2-SXE
942 _cEBK
999 _c79760
_d79760