Cantitate/Preț
Produs

Automata, Universality, Computation: Tribute to Maurice Margenstern: Emergence, Complexity and Computation, cartea 12

Editat de Andrew Adamatzky
en Limba Engleză Hardback – dec 2014
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 61294 lei  6-8 săpt.
  Springer International Publishing – 23 aug 2016 61294 lei  6-8 săpt.
Hardback (1) 61886 lei  6-8 săpt.
  Springer International Publishing – dec 2014 61886 lei  6-8 săpt.

Din seria Emergence, Complexity and Computation

Preț: 61886 lei

Preț vechi: 72807 lei
-15% Nou

Puncte Express: 928

Preț estimativ în valută:
11851 12818$ 9875£

Carte tipărită la comandă

Livrare economică 11-25 decembrie

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

Public țintă

Research

Cuprins

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