Machines, Computations, and Universality

Third International Conference, MCU 2001 Chisinau, Moldava, May 23-27, 2001 Proceedings

AvMaurice Margenstern,Yurii Rogozhin

Häftad, Engelska, 2001

Del i serien Lecture Notes in Computer Science

558 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed proceedings of the Third International Conference on Machines, Computations, and Universality, MCU 2001, held in Chisinau, Moldavia, in May 2001. The book presents nine invited papers together with 13 revised refereed papers selected during a thorough round of reviewing. Among the topics covered are cellular automata, molecular computing, quantum computing, formal languages and automata theory, and computational complexity.

Produktinformation

Utgivningsdatum:2001-05-09
Mått:155 x 235 x 19 mm
Vikt:511 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:328
Upplaga:2001
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540421214

Utforska kategorier

Innehållsförteckning

Invited Lectures Notes.- Three Small Universal Turing Machines.- Computation in Gene Networks.- Power, Puzzles and Properties of Entanglement.- Combinatorial and Computational Problems on Finite Sets of Words.- Computing with Membranes (P Systems): Universality Results.- A Simple Universal Logic Element and Cellular Automata for Reversible Computing.- Some Applications of the Decidability of DPDA’s Equivalence.- The Equivalence Problem for Computational Models: Decidable and Undecidable Cases.- Two Normal Forms for Rewriting P Systems.- Technical Contributions.- On a Conjecture of K?rka. A Turing Machine with No Periodic Configurations.- On the Transition Graphs of Turing Machines.- JC-Nets.- JC-Nets.- Nonterminal Complexity of Programmed Grammars.- Nonterminal Complexity of Programmed Grammars.- On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars.- On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars.- A Direct Construction of a Universal Extended H System.- A Direct Construction of a Universal Extended H System.- Speeding-Up Cellular Automata by Alternations.- Speeding-Up Cellular Automata by Alternations.- Efficient Universal Pushdown Cellular Automata and Their Application to Complexity.- Efficient Universal Pushdown Cellular Automata and Their Application to Complexity.- Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints.- Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints.- P Systems with Membrane Creation: Universality and Efficiency.- P Systems with Membrane Creation: Universality and Efficiency.- On the Computational Power of a Continuous-space Optical Model of Computation.- On theComputational Power of a Continuous-space Optical Model of Computation.- On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT).- On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT).- D0L System + Watson-Crick Complementarity = Universal Computation.- D0L System + Watson-Crick Complementarity = Universal Computation.