Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/1203
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAdamatzky, Andrew. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:26:27Z-
dc.date.available2020-05-17T08:26:27Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319732169 ;en_US
dc.identifier.isbn9783319732152 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1203-
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319732152. ;en_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis book is a tribute to Kenichi Moritaees 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 Moritaees 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, Shorees factorization algorithms, and power consumption of cellular automata. ;en_US
dc.description.statementofresponsibilityedited by Andrew Adamatzky.en_US
dc.format.extentXII, 484 p. 188 illus., 69 illus. in color. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesEmergence, Complexity and Computation, ; 2194-7287 ; ; 30. ;en_US
dc.relation.ispartofseriesEmergence, Complexity and Computation, ; 2194-7287 ; ; 30. ;en_US
dc.relation.haspart9783319732152.pdfen_US
dc.subjectEngineeringen_US
dc.subjectComputational intelligence. ;en_US
dc.subjectComplexity, Computational. ;en_US
dc.subjectEngineeringen_US
dc.subjectComplexity. ;en_US
dc.subjectComputational Intelligence. ;en_US
dc.subject.ddc620 ; 23 ;en_US
dc.subject.lccQA76.9.M35 ;en_US
dc.titleReversibility and Universalityen_US
dc.title.alternativeEssays Presented to Kenichi Morita on the Occasion of his 70th Birthday /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319732152.pdf62.85 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAdamatzky, Andrew. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:26:27Z-
dc.date.available2020-05-17T08:26:27Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319732169 ;en_US
dc.identifier.isbn9783319732152 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1203-
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319732152. ;en_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis book is a tribute to Kenichi Moritaees 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 Moritaees 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, Shorees factorization algorithms, and power consumption of cellular automata. ;en_US
dc.description.statementofresponsibilityedited by Andrew Adamatzky.en_US
dc.format.extentXII, 484 p. 188 illus., 69 illus. in color. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesEmergence, Complexity and Computation, ; 2194-7287 ; ; 30. ;en_US
dc.relation.ispartofseriesEmergence, Complexity and Computation, ; 2194-7287 ; ; 30. ;en_US
dc.relation.haspart9783319732152.pdfen_US
dc.subjectEngineeringen_US
dc.subjectComputational intelligence. ;en_US
dc.subjectComplexity, Computational. ;en_US
dc.subjectEngineeringen_US
dc.subjectComplexity. ;en_US
dc.subjectComputational Intelligence. ;en_US
dc.subject.ddc620 ; 23 ;en_US
dc.subject.lccQA76.9.M35 ;en_US
dc.titleReversibility and Universalityen_US
dc.title.alternativeEssays Presented to Kenichi Morita on the Occasion of his 70th Birthday /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319732152.pdf62.85 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAdamatzky, Andrew. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:26:27Z-
dc.date.available2020-05-17T08:26:27Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319732169 ;en_US
dc.identifier.isbn9783319732152 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1203-
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319732152. ;en_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis book is a tribute to Kenichi Moritaees 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 Moritaees 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, Shorees factorization algorithms, and power consumption of cellular automata. ;en_US
dc.description.statementofresponsibilityedited by Andrew Adamatzky.en_US
dc.format.extentXII, 484 p. 188 illus., 69 illus. in color. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesEmergence, Complexity and Computation, ; 2194-7287 ; ; 30. ;en_US
dc.relation.ispartofseriesEmergence, Complexity and Computation, ; 2194-7287 ; ; 30. ;en_US
dc.relation.haspart9783319732152.pdfen_US
dc.subjectEngineeringen_US
dc.subjectComputational intelligence. ;en_US
dc.subjectComplexity, Computational. ;en_US
dc.subjectEngineeringen_US
dc.subjectComplexity. ;en_US
dc.subjectComputational Intelligence. ;en_US
dc.subject.ddc620 ; 23 ;en_US
dc.subject.lccQA76.9.M35 ;en_US
dc.titleReversibility and Universalityen_US
dc.title.alternativeEssays Presented to Kenichi Morita on the Occasion of his 70th Birthday /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319732152.pdf62.85 MBAdobe PDFThumbnail
Preview File