Machines, computations, and universality. 3rd international conference, MCU 2001, Chişinǎu, Moldova, May 23--27, 2001. Proceedings (Q5941715)

The articles of this volume will be reviewed individually. The preceding colloquium (2nd, 1998) has been reviewed (see Zbl 0948.00049). Indexed articles: \textit{Baiocchi, Claudio}, Three small universal Turing machines, 1-10 [Zbl 0986.68032] \textit{Ben-Hur, Asa; Siegelmann, Hava T.}, Computation in gene networks, 11-24 [Zbl 0984.68069] \textit{Gruska, Jozef; Imai, Hiroshi}, Power, puzzles and properties of entanglement, 25-68 [Zbl 0984.81019] \textit{Karhumäki, Juhani}, Combinatorial and computational problems on finite sets of words, 69-81 [Zbl 0984.68118] \textit{Martín-Vide, Carlos; Păun, Gheorghe}, Computing with membranes (P systems): Universality results, 82-101 [Zbl 0984.68070] \textit{Morita, Kenichi}, A simple universal logic element and cellular automata for reversible computing, 102-113 [Zbl 0984.68512] \textit{Sénizergues, Géraud}, Some applications of the decidability of DPDA's equivalence, 114-132 [Zbl 0984.68096] \textit{Zakharov, Vladimir A.}, The equivalence problem for computational models: Decidable and undecidable cases, 133-152 [Zbl 0984.68075] \textit{Zandron, Claudio; Ferretti, Claudio; Mauri, Giancarlo}, Two normal forms for rewriting P systems, 153-164 [Zbl 0984.68510] \textit{Blondel, Vincent D.; Cassaigne, Julien; Nichitiu, Codrin}, On a conjecture of Kůrka. A Turing machine with no periodic configurations, 165-176 [Zbl 0984.68072] \textit{Caucal, Didier}, On the transition graphs of Turing machines, 177-189 [Zbl 0984.68073] \textit{Ciobanu, Gabriel; Rotaru, Mihai}, JC-nets, 190-201 [Zbl 0984.68112] \textit{Fernau, Henning}, Nonterminal complexity of programmed grammars, 202-213 [Zbl 0984.68090] \textit{Freund, Rudolf; Păun, Gheorghe}, On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars, 214-225 [Zbl 0984.68091] \textit{Frisco, Pierluigi}, A direct construction of a universal extended H system, 226-239 [Zbl 0984.68087] \textit{Iwamoto, Chuzo; Tateishi, Katsuyuki; Morita, Kenichi; Imai, Katsunobu}, Speeding-up cellular automata by alternations, 240-251 [Zbl 0984.68108] \textit{Kutrib, Martin}, Efficient universal pushdown cellular automata and their application to complexity, 252-263 [Zbl 0984.68110] \textit{La Torre, Salvatore; Napoli, Margherita; Parente, Mimmo}, Firing squad synchronization problem on bidimensional cellular automata with communication constraints, 264-275 [Zbl 0984.68109] \textit{Mutyam, Madhu; Krithivasan, Kamala}, P systems with membrane creation: Universality and efficiency, 276-287 [Zbl 0984.68074] \textit{Naughton, Thomas J.; Woods, Damien}, On the computational power of a continuous-space optical model of computation, 288-299 [Zbl 0984.68507] \textit{Sadowski, Zenon}, On a P-optimal proof system for the set of all satisfiable Boolean formulas (SAT), 300-307 [Zbl 0984.03045] \textit{Sosík, Petr}, D0L system + Watson-Crick complementarity = universal computation, 308-319 [Zbl 0984.68088]