Automata, Universality, Computation : Tribute to Maurice Margenstern /

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 mathem...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Adamatzky, Andrew (Editor)
Format: eBook
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2015.
Series:Emergence, Complexity and Computation, 12
Subjects:
Online Access:Click here to view the full text content
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 03351nam a2200445 i 4500
001 vtls000129354
003 MY-ArUMP
005 20210731153245.0
006 m fo d
007 cr nn 008mamaa
008 170426s2015 gw | fs |||| 0|eng d
020 |a 9783319090399 
039 9 |a 201706141442  |b SS  |y 201704261223  |z NY 
040 |a MYPMP  |b eng  |c MYPMP  |e rda 
245 1 0 |a Automata, Universality, Computation :  |b Tribute to Maurice Margenstern /  |c edited by Andrew Adamatzky. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2015. 
300 |a 1 online resource (xii, 418 pages)  |b 107 illustrations, 24 illustrations in color 
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 Engineering. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Computer mathematics. 
650 0 |a Physics. 
650 0 |a Complexity, Computational. 
700 1 |a Adamatzky, Andrew.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783319090382 
830 0 |a Emergence, Complexity and Computation,  |x 2194-7287 ;  |v 12 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-09039-9  |y Click here to view the full text content 
942 |2 lcc  |c BK-EBOOK 
949 |a VIRTUAITEM  |d 10011  |f 1  |x 9 
950 |a Engineering (Springer-11647) 
999 |c 65050  |d 65050 
952 |0 0  |1 0  |2 lcc  |4 0  |7 0  |9 56425  |a FSGM  |b FSGM  |d 2021-07-31  |l 0  |r 2021-07-31  |t 1  |w 2021-07-31  |y BK-EBOOK