東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Reversibility and universality = ess...

Adamatzky, Andrew.

FindBook

Google Book

Amazon

博客來

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.
出版者:	Cham :Springer International Publishing : : 2018.,
面頁冊數:	xii, 484 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Reversible computing. -
電子資源:	http://dx.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. - Cham :Springer International Publishing :2018. - xii, 484 p. :ill., digital ;24 cm. - Emergence, complexity and computation,v.302194-7287 ;. - Emergence, complexity and computation ;v.30..

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:

2114958
Reversible computing.

LC Class. No.: QA76.9.R48

Dewey Class. No.: 004

Reversibility and universality = essays presented to Kenichi Morita on the occasion of his 70th birthday /
LDR:03130nmm a2200313 a 4500 001 2133989
003 DE-He213
005 20180226193325.0
006 m d
007 cr nn 008maaau
008 181005s2018 gw s 0 eng d
020 $a 9783319732169 $q (electronic bk.)
020 $a 9783319732152 $q (paper)
024 7 $a 10.1007/978-3-319-73216-9 $2 doi
035 $a 978-3-319-73216-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.R48
072 7 $a GPFC $2 bicssc
072 7 $a TEC000000 $2 bisacsh
082 0 4 $a 004 $2 23
090 $a QA76.9.R48 $b R452 2018
245 0 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.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a xii, 484 p. : $b ill., digital ; $c 24 cm.
490 1 $a Emergence, complexity and computation, $x 2194-7287 ; $v 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 Reversible computing. $3 2114958
650 1 4 $a Engineering. $3 586835
650 2 4 $a Complexity. $3 893807
650 2 4 $a Computational Intelligence. $3 1001631
700 1 $a Adamatzky, Andrew. $3 862386
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Emergence, complexity and computation ; $v v.30. $3 3302005
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-73216-9
950 $a Engineering (Springer-11647)