Machines, Computations, and Universality 8th International Conference, MCU 2018, Fontainebleau, France, June 28-30, 2018, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Durand-Lose, Jérôme (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Verlan, Sergey (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2018.
• Έκδοση: 1st ed. 2018.
• Σειρά: Theoretical Computer Science and General Issues ; 10881
• Θέματα: Algorithms.; Architecture, Computer.; Mathematical logic.; Computer logic.; Special purpose computers.; Algorithm Analysis and Problem Complexity.; Computer System Implementation.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Special Purpose and Application-Based Systems.

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

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