Automata, Universality, Computation: Tribute to Maurice Margenstern: Emergence, Complexity and Computation, cartea 12
Editat de Andrew Adamatzkyen Limba Engleză Hardback – dec 2014
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 634.00 lei 43-57 zile | |
Springer International Publishing – 23 aug 2016 | 634.00 lei 43-57 zile | |
Hardback (1) | 640.11 lei 43-57 zile | |
Springer International Publishing – dec 2014 | 640.11 lei 43-57 zile |
Din seria Emergence, Complexity and Computation
- 8% Preț: 389.83 lei
- 18% Preț: 1109.67 lei
- 18% Preț: 927.55 lei
- 20% Preț: 638.56 lei
- 20% Preț: 570.97 lei
- 15% Preț: 635.13 lei
- 15% Preț: 638.02 lei
- 20% Preț: 921.90 lei
- Preț: 384.49 lei
- 15% Preț: 634.50 lei
- 15% Preț: 628.74 lei
- 15% Preț: 632.24 lei
- 15% Preț: 635.95 lei
- 18% Preț: 1386.50 lei
- 20% Preț: 1277.96 lei
- 20% Preț: 1269.87 lei
- 20% Preț: 642.09 lei
- 15% Preț: 635.45 lei
- 18% Preț: 934.50 lei
- 20% Preț: 643.72 lei
- 18% Preț: 1094.38 lei
- 20% Preț: 972.14 lei
- 15% Preț: 643.47 lei
- 20% Preț: 636.46 lei
- 15% Preț: 641.20 lei
- 20% Preț: 647.76 lei
- 20% Preț: 632.40 lei
- 20% Preț: 644.88 lei
- 20% Preț: 631.11 lei
- 18% Preț: 862.92 lei
- 20% Preț: 1426.22 lei
- 20% Preț: 1134.78 lei
Preț: 640.11 lei
Preț vechi: 753.07 lei
-15% Nou
Puncte Express: 960
Preț estimativ în valută:
122.50€ • 127.25$ • 101.76£
122.50€ • 127.25$ • 101.76£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319090382
ISBN-10: 3319090380
Pagini: 363
Ilustrații: XI, 418 p. 107 illus., 24 illus. in color.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.78 kg
Ediția:2015
Editura: Springer International Publishing
Colecția Springer
Seria Emergence, Complexity and Computation
Locul publicării:Cham, Switzerland
ISBN-10: 3319090380
Pagini: 363
Ilustrații: XI, 418 p. 107 illus., 24 illus. in color.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.78 kg
Ediția:2015
Editura: Springer International Publishing
Colecția Springer
Seria Emergence, Complexity and Computation
Locul publicării:Cham, Switzerland
Public țintă
ResearchCuprins
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.
Textul de pe ultima copertă
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.
Caracteristici
Provides accessible and lively excursions into mathematical machines geared for universal computation Advances broadly interesting topics of universal computation, automata, and theoretical computer science Comprised of unique chapters written by world top experts in theory of mathematical machines and computation Lavishly illustrated with visually attractive examples of mathematical machines, which will appeal not only to scientists but also to artists and general public