Machines, Computations, and Universality

4th International Conference, MCU 2004, Saint Petersburg, Russia, September 21-24, 2004, Revised Selected Papers

  • Maurice Margenstern
Conference proceedings MCU 2004

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3354)

Table of contents

  1. Front Matter
    PDF

  2. Invited Lectures

    1. Algorithmic Randomness, Quantum Physics, and Incompleteness
      Cristian S. Calude
      Pages 1-17
    2. On the Complexity of Universal Programs
      Alain Colmerauer
      Pages 18-35
    3. Finite Sets of Words and Computing
      Juhani Karhumäki
      Pages 36-49
    4. Universality and Cellular Automata
      K. Sutner
      Pages 50-59
    5. Leaf Language Classes
      Klaus W. Wagner
      Pages 60-81

  3. Selected Contributions

    1. Computational Completeness of P Systems with Active Membranes and Two Polarizations
      Artiom Alhazov, Rudolf Freund, Gheorghe Păun
      Pages 82-92
    2. Computing with a Distributed Reaction-Diffusion Model
      S. Bandini, G. Mauri, G. Pavesi, C. Simone
      Pages 93-103
    3. Computational Universality in Symbolic Dynamical Systems
      Jean-Charles Delvenne, Petr Kůrka, Vincent D. Blondel
      Pages 104-115
    4. Real Recursive Functions and Real Extensions of Recursive Functions
      Olivier Bournez, Emmanuel Hainry
      Pages 116-127
    5. Ordering and Convex Polyominoes
      Giusi Castiglione, Antonio Restivo
      Pages 128-139
    6. Subshifts Behavior of Cellular Automata. Topological Properties and Related Languages
      Gianpiero Cattaneo, Alberto Dennunzio
      Pages 140-152
    7. Evolution and Observation: A Non-standard Way to Accept Formal Languages
      Matteo Cavaliere, Peter Leupold
      Pages 153-163
    8. The Computational Power of Continuous Dynamic Systems
      Jerzy Mycka, José Félix Costa
      Pages 164-175
    9. Abstract Geometrical Computation for Black Hole Computation
      Jérôme Durand-Lose
      Pages 176-187
    10. Is Bosco’s Rule Universal?
      Kellie Michele Evans
      Pages 188-199
    11. Sequential P Systems with Unit Rules and Energy Assigned to Membranes
      Rudolf Freund, Alberto Leporati, Marion Oswald, Claudio Zandron
      Pages 200-210
    12. Hierarchies of DLOGTIME-Uniform Circuits
      Chuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu
      Pages 211-222
    13. Several New Generalized Linear- and Optimum-Time Synchronization Algorithms for Two-Dimensional Rectangular Arrays
      Hiroshi Umeo, Masaya Hisaoka, Masato Teraoka, Masashi Maeda
      Pages 223-232
    14. Register Complexity of LOOP-, WHILE-, and GOTO-Programs
      Markus Holzer, Martin Kutrib
      Pages 233-244

About these proceedings

Keywords

Erfüllbarkeitsproblem der Aussagenlogik Monoid P systems algorithms automata cellular automata complexity formal language logic natural computing ramdomness theoretical computer science theory of computing turing machines universality

Editors and affiliations

  • Maurice Margenstern
    • 1
  1. 1.IUT de Metz, LITAUniversité Paul Verlaine - MetzMetz, CédexFrance

Bibliographic information

  • DOI https://doi.org/10.1007/b106980
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-25261-0
  • Online ISBN 978-3-540-31834-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site