Language:
English
繁體中文
Help
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
Automata, Universality, Computation ...
~
Adamatzky, Andrew.
Automata, Universality, Computation = Tribute to Maurice Margenstern /
Record Type:
Language materials, printed : Monograph/item
Title/Author:
Automata, Universality, Computation/ edited by Andrew Adamatzky.
Reminder of title:
Tribute to Maurice Margenstern /
other author:
Adamatzky, Andrew.
Description:
XII, 418 p. 107 illus., 24 illus. in color.online resource. :
Contained By:
Springer Nature eBook
Subject:
Computational complexity. -
Online resource:
https://doi.org/10.1007/978-3-319-09039-9
ISBN:
9783319090399
Automata, Universality, Computation = Tribute to Maurice Margenstern /
Automata, Universality, Computation
Tribute to Maurice Margenstern /[electronic resource] :edited by Andrew Adamatzky. - 1st ed. 2015. - XII, 418 p. 107 illus., 24 illus. in color.online resource. - Emergence, Complexity and Computation,122194-7287 ;. - Emergence, Complexity and Computation,12.
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
Standard No.: 10.1007/978-3-319-09039-9doiSubjects--Topical Terms:
527777
Computational complexity.
LC Class. No.: QA267.7
Dewey Class. No.: 620
Automata, Universality, Computation = Tribute to Maurice Margenstern /
LDR
:03110nam a22004095i 4500
001
960555
003
DE-He213
005
20200629204211.0
007
cr nn 008mamaa
008
201211s2015 gw | s |||| 0|eng d
020
$a
9783319090399
$9
978-3-319-09039-9
024
7
$a
10.1007/978-3-319-09039-9
$2
doi
035
$a
978-3-319-09039-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
Automata, Universality, Computation
$h
[electronic resource] :
$b
Tribute to Maurice Margenstern /
$c
edited by Andrew Adamatzky.
250
$a
1st ed. 2015.
264
1
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2015.
300
$a
XII, 418 p. 107 illus., 24 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
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
Computational complexity.
$3
527777
650
0
$a
Physics.
$3
564049
650
0
$a
Computer science—Mathematics.
$3
1253519
650
0
$a
Computer mathematics.
$3
1199796
650
1 4
$a
Complexity.
$3
669595
650
2 4
$a
Applications of Graph Theory and Complex Networks.
$3
1113468
650
2 4
$a
Mathematical Applications in Computer Science.
$3
815331
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
9783319090405
776
0 8
$i
Printed edition:
$z
9783319090382
776
0 8
$i
Printed edition:
$z
9783319363677
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-09039-9
912
$a
ZDB-2-ENG
912
$a
ZDB-2-SXE
950
$a
Engineering (SpringerNature-11647)
950
$a
Engineering (R0) (SpringerNature-43712)
based on 0 review(s)
Multimedia
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login