| 2001 | A Direct Construction of a Universal Extended H System. Pierluigi Frisco |
| 2001 | A Simple Universal Logic Element and Cellular Automata for Reversible Computing. Kenichi Morita |
| 2001 | Combinatorial and Computational Problems on Finite Sets of Words. Juhani Karhumäki |
| 2001 | Computation in Gene Networks. Asa Ben-Hur, Hava T. Siegelmann |
| 2001 | Computing with Membranes (P Systems): Universality Results. Carlos Martín-Vide, Gheorghe Paun |
| 2001 | D0L System + Watson-Crick Complementarity = Universal Computation. Petr Sosík |
| 2001 | Efficient Universal Pushdown Cellular Automata and Their Application to Complexity. Martin Kutrib |
| 2001 | Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints. Salvatore La Torre, Margherita Napoli, Mimmo Parente |
| 2001 | JC-Nets. Gabriel Ciobanu, Mihai Rotaru |
| 2001 | Machines, Computations, and Universality, Third International Conference, MCU 2001, Chisinau, Moldova, May 23-27, 2001, Proceedings Maurice Margenstern, Yurii Rogozhin |
| 2001 | Nonterminal Complexity of Programmed Grammars. Henning Fernau |
| 2001 | On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations. Vincent D. Blondel, Julien Cassaigne, Codrin M. Nichitiu |
| 2001 | On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT). Zenon Sadowski |
| 2001 | On the Computational Power of a Continuous-Space Optical Model of Computation. Thomas J. Naughton, Damien Woods |
| 2001 | On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars. Rudolf Freund, Gheorghe Paun |
| 2001 | On the Transition Graphs of Turing Machines. Didier Caucal |
| 2001 | P Systems with Membrane Creation: Universality and Efficiency. Madhu Mutyam, Kamala Krithivasan |
| 2001 | Power, Puzzles and Properties of Entanglement. Jozef Gruska, Hiroshi Imai |
| 2001 | Some Applications of the Decidability of DPDA's Equivalence. Géraud Sénizergues |
| 2001 | Speeding-Up Cellular Automata by Alternations. Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai |
| 2001 | The Equivalence Problem for Computational Models: Decidable and Undecidable Cases. Vladimir A. Zakharov |
| 2001 | Three Small Universal Turing Machines. Claudio Baiocchi |
| 2001 | Two Normal Forms for Rewriting P Systems. Claudio Zandron, Claudio Ferretti, Giancarlo Mauri |