Machines, Computations, and Universality: 4th International Conference, MCU 2004, Saint Petersburg, Russia, September 21-24, 2004, Revised Selected Papers

Cristian S. Calude (auth.), Maurice Margenstern (eds.)3540252614, 9783540252610

This book constitutes the thoroughly refereed postproceedings of the 4th International Conference on Machines, Computations, and Universality, MCU 2004, held in St. Petersburg, Russia in September 2004.

The 21 revised full papers presented together with 5 invited papers went through two rounds of reviewing, selection, and improvement. A broad variety of foundational aspects in theoretical computer science are addressed, such as cellular automata, molecular computing, quantum computing, formal languages, automata theory, Turing machines, P systems, etc.

---

Table of contents :
Front Matter….Pages –
Algorithmic Randomness, Quantum Physics, and Incompleteness….Pages 1-17
On the Complexity of Universal Programs….Pages 18-35
Finite Sets of Words and Computing….Pages 36-49
Universality and Cellular Automata….Pages 50-59
Leaf Language Classes….Pages 60-81
Computational Completeness of P Systems with Active Membranes and Two Polarizations….Pages 82-92
Computing with a Distributed Reaction-Diffusion Model….Pages 93-103
Computational Universality in Symbolic Dynamical Systems….Pages 104-115
Real Recursive Functions and Real Extensions of Recursive Functions….Pages 116-127
Ordering and Convex Polyominoes….Pages 128-139
Subshifts Behavior of Cellular Automata. Topological Properties and Related Languages….Pages 140-152
Evolution and Observation: A Non-standard Way to Accept Formal Languages….Pages 153-163
The Computational Power of Continuous Dynamic Systems….Pages 164-175
Abstract Geometrical Computation for Black Hole Computation….Pages 176-187
Is Bosco’s Rule Universal?….Pages 188-199
Sequential P Systems with Unit Rules and Energy Assigned to Membranes….Pages 200-210
Hierarchies of DLOGTIME-Uniform Circuits….Pages 211-222
Several New Generalized Linear- and Optimum-Time Synchronization Algorithms for Two-Dimensional Rectangular Arrays….Pages 223-232
Register Complexity of LOOP -, WHILE -, and GOTO -Programs….Pages 233-244
Classification and Universality of Reversible Logic Elements with One-Bit Memory….Pages 245-256
Universal Families of Reversible P Systems….Pages 257-268
Solving 3CNF-SAT and HPP in Linear Time Using WWW….Pages 269-280
Completing a Code in a Regular Submonoid of the Free Monoid….Pages 281-291
On Computational Universality in Language Equations….Pages 292-303
Attacking the Common Algorithmic Problem by Recognizer P Systems….Pages 304-315
On the Minimal Automaton of the Shuffle of Words and Araucarias….Pages 316-327
Back Matter….Pages –