Skip to main content
Springer Nature Link
Log in

Machines, Computations, and Universality

5th International Conference, MCU 2007, Orleans, France, September 10-13, 2007, Proceedings

  • Conference proceedings
  • © 2007

Overview

Editors:
  1. Jérôme Durand-Lose
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Maurice Margenstern
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: MCU 2007.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (27 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. Encapsulating Reaction-Diffusion Computers

      • Andrew Adamatzky
      Pages 1-11

    2. On the Computational Capabilities of Several Models

      • Olivier Bournez, Emmanuel Hainry
      Pages 12-23

    3. Universality, Reducibility, and Completeness

      • Mark Burgin
      Pages 24-38

    4. Using Approximation to Relate Computational Classes over the Reals

      • Manuel L. Campagnolo, Kerry Ojakian
      Pages 39-61

    5. A Survey of Infinite Time Turing Machines

      • Joel David Hamkins
      Pages 62-71

    6. The Tiling Problem Revisited (Extended Abstract)

      • Jarkko Kari
      Pages 72-79

    7. Decision Versus Evaluation in Algebraic Complexity

      • Pascal Koiran
      Pages 80-89

    8. A Universal Reversible Turing Machine

      • Kenichi Morita, Yoshikazu Yamaguchi
      Pages 90-98

    9. P Systems and Picture Languages

      • K. G. Subramanian
      Pages 99-109

  3. Regular Papers

    1. Partial Halting in P Systems Using Membrane Rules with Permitting Contexts

      • Artiom Alhazov, Rudolf Freund, Marion Oswald, Sergey Verlan
      Pages 110-121

    2. Uniform Solution of QSAT Using Polarizationless Active Membranes

      • Artiom Alhazov, Mario J. Pérez-Jiménez
      Pages 122-133

    3. Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem

      • Dorothea Baumeister, Jörg Rothe
      Pages 134-145

    4. Planar Trivalent Network Computation

      • Tommaso Bolognesi
      Pages 146-157

    5. On the Power of Networks of Evolutionary Processors

      • Jürgen Dassow, Bianca Truthe
      Pages 158-169

    6. Study of Limits of Solvability in Tag Systems

      • Liesbeth De Mol
      Pages 170-181

    7. Query Completeness of Skolem Machine Computations

      • John Fisher, Marc Bezem
      Pages 182-192

    8. More on the Size of Higman-Haines Sets: Effective Constructions

      • Hermann Gruber, Markus Holzer, Martin Kutrib
      Pages 193-204

    9. Insertion-Deletion Systems with One-Sided Contexts

      • Artiom Matveevici, Yurii Rogozhin, Sergey Verlan
      Pages 205-217

    10. Accepting Networks of Splicing Processors with Filtered Connections

      • Juan Castellanos, Florin Manea, Luis Fernando de Mingo López, Victor Mitrana
      Pages 218-229
Back to top

Other volumes

  1. Machines, Computations, and Universality

Bibliographic Information

Publish with us

Policies and ethics

Back to top