國立虎尾科技大學 |

Reversibility and Universality = Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Reversibility and Universality/ edited by Andrew Adamatzky.
其他題名:	Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday /
其他作者:	Adamatzky, Andrew.
面頁冊數:	XII, 484 p. 188 illus., 69 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computational complexity. -
電子資源:	https://doi.org/10.1007/978-3-319-73216-9
ISBN:	9783319732169

Reversibility and Universality = Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday /
Reversibility and UniversalityEssays Presented to Kenichi Morita on the Occasion of his 70th Birthday /[electronic resource] :edited by Andrew Adamatzky. - 1st ed. 2018. - XII, 484 p. 188 illus., 69 illus. in color.online resource. - Emergence, Complexity and Computation,302194-7287 ;. - Emergence, Complexity and Computation,12.

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.

ISBN: 9783319732169

Standard No.: 10.1007/978-3-319-73216-9doiSubjects--Topical Terms:

527777
Computational complexity.

LC Class. No.: QA267.7

Dewey Class. No.: 620

Reversibility and Universality = Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday /
LDR:03541nam a22003975i 4500 001 997997
003 DE-He213
005 20200705100736.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783319732169 $9 978-3-319-73216-9
024 7 $a 10.1007/978-3-319-73216-9 $2 doi
035 $a 978-3-319-73216-9
050 4 $a QA267.7
072 7 $a GPFC $2 bicssc
072 7 $a TEC009000 $2 bisacsh
072 7 $a GPFC $2 thema
082 0 4 $a 620 $2 23
245 1 0 $a Reversibility and Universality $h [electronic resource] : $b Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday / $c edited by Andrew Adamatzky.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a XII, 484 p. 188 illus., 69 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Emergence, Complexity and Computation, $x 2194-7287 ; $v 30
520 $a 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.
650 0 $a Computational complexity. $3 527777
650 0 $a Computational intelligence. $3 568984
650 1 4 $a Complexity. $3 669595
650 2 4 $a Computational Intelligence. $3 768837
700 1 $a Adamatzky, Andrew. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 670221
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319732152
776 0 8 $i Printed edition: $z 9783319732176
776 0 8 $i Printed edition: $z 9783030103347
830 0 $a Emergence, Complexity and Computation, $x 2194-7287 ; $v 12 $3 1254548
856 4 0 $u https://doi.org/10.1007/978-3-319-73216-9
912 $a ZDB-2-ENG
912 $a ZDB-2-SXE
950 $a Engineering (SpringerNature-11647)
950 $a Engineering (R0) (SpringerNature-43712)