大葉大學圖書館 |

Automata, universality, computation[electronic resource] :tribute to Maurice Margenstern /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	511.35
書名/作者:	Automata, universality, computation : tribute to Maurice Margenstern // edited by Andrew Adamatzky.
其他作者:	Adamatzky, Andrew.
出版者:	Cham : : Springer International Publishing :, 2015.
面頁冊數:	xii, 418 p. : : ill. (some col.), digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Machine theory.
標題:	Computer science.
標題:	Engineering.
標題:	Complexity.
標題:	Complex Networks.
標題:	Mathematical Applications in Computer Science.
ISBN:	9783319090399 (electronic bk.)
ISBN:	9783319090382 (paper)
內容註:	The common structure of the curves having a same Gauss word -- Logical theory of the additive monoid of subsets of natural integers -- Some reflections on mathematics and its relation to computer Science -- Sampling a Two-way Finite Automaton -- Constructing reversible Turing machines by reversible logic element with memory -- The Grossone methodology perspective on Turing machines -- On Parallel Array P Systems -- Computational models based on splicing -- Linear Cellular Automata and Decidability -- Algorithms with Active Cells Modeled by Cellular Automata with Write-Access (CA-w) -- Broadcasting automata and patterns on Z2 -- Real-Time Prime Generators Implemented on Small-State Cellular Automata -- Phyllosilicate Automata.
摘要、提要註:	This book is an intellectually stimulating excursion into mathematical machines and structures capable for a universal computation. World top experts in computer science and mathematics overview exciting and intriguing topics of logical theory of monoids, geometry of Gauss word, philosophy of mathematics in computer science, asynchronous and parallel P-systems, decidability in cellular automata, splicing systems, reversible Turing machines, information flows in two-way finite automata, prime generators in automaton arrays, Grossone and Turing machines, automaton models of atomic lattices. The book is full of visually attractive examples of mathematical machines, open problems and challenges for future research. Those interested in the advancement of a theory of computation, philosophy of mathematics, future and emergent computing paradigms, architectures and implementations will find the book vital for their research and development.
電子資源:	http://dx.doi.org/10.1007/978-3-319-09039-9

Automata, universality, computation[electronic resource] :tribute to Maurice Margenstern /
Automata, universality, computationtribute to Maurice Margenstern /[electronic resource] :edited by Andrew Adamatzky. - Cham :Springer International Publishing :2015. - xii, 418 p. :ill. (some col.), digital ;24 cm. - Emergence, complexity and computation,v.122194-7287 ;. - Emergence, complexity and computation ;v.10..

The common structure of the curves having a same Gauss word -- Logical theory of the additive monoid of subsets of natural integers -- Some reflections on mathematics and its relation to computer Science -- Sampling a Two-way Finite Automaton -- Constructing reversible Turing machines by reversible logic element with memory -- The Grossone methodology perspective on Turing machines -- On Parallel Array P Systems -- Computational models based on splicing -- Linear Cellular Automata and Decidability -- Algorithms with Active Cells Modeled by Cellular Automata with Write-Access (CA-w) -- Broadcasting automata and patterns on Z2 -- Real-Time Prime Generators Implemented on Small-State Cellular Automata -- Phyllosilicate Automata.

This book is an intellectually stimulating excursion into mathematical machines and structures capable for a universal computation. World top experts in computer science and mathematics overview exciting and intriguing topics of logical theory of monoids, geometry of Gauss word, philosophy of mathematics in computer science, asynchronous and parallel P-systems, decidability in cellular automata, splicing systems, reversible Turing machines, information flows in two-way finite automata, prime generators in automaton arrays, Grossone and Turing machines, automaton models of atomic lattices. The book is full of visually attractive examples of mathematical machines, open problems and challenges for future research. Those interested in the advancement of a theory of computation, philosophy of mathematics, future and emergent computing paradigms, architectures and implementations will find the book vital for their research and development.

ISBN: 9783319090399 (electronic bk.)

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

173754
Machine theory.

LC Class. No.: QA267

Dewey Class. No.: 511.35

Automata, universality, computation[electronic resource] :tribute to Maurice Margenstern /
LDR:02707nam a2200325 a 4500 001 425400
003 DE-He213
005 20150714111237.0
006 m d
007 cr nn 008maaau
008 151119s2015 gw s 0 eng d
020 $a 9783319090399 (electronic bk.)
020 $a 9783319090382 (paper)
024 7 $a 10.1007/978-3-319-09039-9 $2 doi
035 $a 978-3-319-09039-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267
072 7 $a GPFC $2 bicssc
072 7 $a TEC000000 $2 bisacsh
082 0 4 $a 511.35 $2 23
090 $a QA267 $b .A939 2015
245 0 0 $a Automata, universality, computation $h [electronic resource] : $b tribute to Maurice Margenstern / $c edited by Andrew Adamatzky.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a xii, 418 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Emergence, complexity and computation, $x 2194-7287 ; $v v.12
505 0 $a The common structure of the curves having a same Gauss word -- Logical theory of the additive monoid of subsets of natural integers -- Some reflections on mathematics and its relation to computer Science -- Sampling a Two-way Finite Automaton -- Constructing reversible Turing machines by reversible logic element with memory -- The Grossone methodology perspective on Turing machines -- On Parallel Array P Systems -- Computational models based on splicing -- Linear Cellular Automata and Decidability -- Algorithms with Active Cells Modeled by Cellular Automata with Write-Access (CA-w) -- Broadcasting automata and patterns on Z2 -- Real-Time Prime Generators Implemented on Small-State Cellular Automata -- Phyllosilicate Automata.
520 $a This book is an intellectually stimulating excursion into mathematical machines and structures capable for a universal computation. World top experts in computer science and mathematics overview exciting and intriguing topics of logical theory of monoids, geometry of Gauss word, philosophy of mathematics in computer science, asynchronous and parallel P-systems, decidability in cellular automata, splicing systems, reversible Turing machines, information flows in two-way finite automata, prime generators in automaton arrays, Grossone and Turing machines, automaton models of atomic lattices. The book is full of visually attractive examples of mathematical machines, open problems and challenges for future research. Those interested in the advancement of a theory of computation, philosophy of mathematics, future and emergent computing paradigms, architectures and implementations will find the book vital for their research and development.
650 0 $a Machine theory. $3 173754
650 0 $a Computer science. $3 182962
650 1 4 $a Engineering. $3 372756
650 2 4 $a Complexity. $3 464233
650 2 4 $a Complex Networks. $3 465367
650 2 4 $a Mathematical Applications in Computer Science. $3 467521
700 1 $a Adamatzky, Andrew. $3 502997
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Emergence, complexity and computation ; $v v.10. $3 589012
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-09039-9
950 $a Engineering (Springer-11647)