000			03736nam a22003735i 4500
999			_c103034 _d103034
001			103034
003			DE-He213
005			20230102113111.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			180226s2018 gw | s |||| 0|eng d
020			_a9783319732169
024	7		_a10.1007/978-3-319-73216-9 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050			_aQA76.9.R48 2018 EB
245	1	0	_aReversibility and Universality _bEssays Presented to Kenichi Morita on the Occasion of his 70th Birthday _cedited by Andrew Adamatzky.
264		1	_aCham _bSpringer International Publishing _c2018
300			_a1 recurso en línea (XII, 484 páginas 188 ilustraciones, 69 ilustraciones a color)
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_atext file _bPDF
490	0		_aEmergence, Complexity and Computation _x2194-7287 _v30
490	0		_aEngineering (Springer-11647)
520	3		_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.
988			_aEBSPRINGER_2018
650		7	_aIngeniería del software _2embne _9152630
700	1		_aAdamatzky, Andrew _eeditor literario _4edt _4http://id.loc.gov/vocabulary/relators/edt _0http://id.loc.gov/authorities/names/n95020912 _1http://viaf.org/viaf/103118502/ _998020
776	0	8	_iEdición impresa: _z9783319732152
776	0	8	_iEdición impresa: _z9783319732176
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-319-73216-9 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b03/2019 _dz _ek _feng _ggw _h0