Cantitate/Preț
Produs

Machines, Computations, and Universality: 8th International Conference, MCU 2018, Fontainebleau, France, June 28–30, 2018, Proceedings: Lecture Notes in Computer Science, cartea 10881

Editat de Jérôme Durand-Lose, Sergey Verlan
en Limba Engleză Paperback – 26 mai 2018
This book constitutes the refereed proceedings of the 8th International Conference on Machines, Computations, and Universality, MCU 2018, held in Fontainebleau, France, in June 2018.
The 9 revised full papers presented together with 5 invited talks were carefully reviewed and selected from numerous submissions. MCU explores computation in the setting of various discrete models (Turing machines, register machines, cellular automata, tile assembly systems, rewriting systems, molecular computing models, neural models, concurrent systems, etc.) and analog and hybrid models (BSS machines, infinite time cellular automata, real machines, quantum computing, etc.).
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32071 lei

Preț vechi: 40089 lei
-20% Nou

Puncte Express: 481

Preț estimativ în valută:
6138 6376$ 5098£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319924014
ISBN-10: 331992401X
Pagini: 168
Ilustrații: XVII, 171 p. 27 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.28 kg
Ediția:1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Control Mechanisms for Array Grammars on Cayley Grids.- A Pleasant Stroll Through the Land of Distributed Machines, Computation, and Universality.- Sequential Grammars with Activation and Blocking of Rules.- The Language (and Series) of Hammersley-type Processes.- Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case.- Minimal Useful Size of Counters for (Real-Time) Multicounter Automata.- A Framework for (De)composing with Boolean Automata Networks.- An Extension of Interval-valued Computing Equivalent to Red-green Turing Machines.- Physical Computation and First-Order Logic.