Volume 11, Issue 4, December 2012

Special Issue "Unconventional Computing 2011"

ISSN: 1567-7818 (Print) 1572-9796 (Online)

In this issue (14 articles)

  1. No Access

    OriginalPaper

    Preface

    Jarkko Kari, Ion Petre Pages 551-552
    Get Access

  2. No Access

    OriginalPaper

    Probing robustness of cellular automata through variations of asynchronous updating

    Olivier Bouré, Nazim Fatès, Vincent Chevrier Pages 553-564
    Look Inside Get Access

  3. No Access

    OriginalPaper

    Conserved quantities in discrete dynamics: what can be recovered from Noether’s theorem, how, and why?

    Silvio Capobianco, Tommaso Toffoli Pages 565-577
    Look Inside Get Access

  4. No Access

    OriginalPaper

    Computation with multiple CTCs of fixed length and width

    A. C. Cem Say, Abuzer Yakaryılmaz Pages 579-594
    Look Inside Get Access

  5. No Access

    OriginalPaper

    Networks of evolutionary processors: computationally complete normal forms

    Jürgen Dassow, Florin Manea, Bianca Truthe Pages 595-607
    Look Inside Get Access

  6. No Access

    OriginalPaper

    Abstract geometrical computation 7: geometrical accumulations and computably enumerable real numbers

    Jérôme Durand-Lose Pages 609-622
    Look Inside Get Access

  7. No Access

    OriginalPaper

    Geometric computations by broadcasting automata

    Russell Martin, Thomas Nickson, Igor Potapov Pages 623-635
    Look Inside Get Access

  8. No Access

    OriginalPaper

    New solutions for disjoint paths in P systems

    Radu Nicolescu, Huiling Wu Pages 637-651
    Look Inside Get Access

  9. No Access

    OriginalPaper

    Extended Watson–Crick L systems with regular trigger languages and restricted derivation modes

    David Sears, Kai Salomaa Pages 653-664
    Look Inside Get Access

  10. No Access

    OriginalPaper

    Computing with planar toppling domino arrangements

    William M. Stevens Pages 665-672
    Look Inside Get Access

  11. No Access

    OriginalPaper

    Cellular automata-based systems with fault-tolerance

    Luděk Žaloudek, Lukáš Sekanina Pages 673-685
    Look Inside Get Access

  12. No Access

    OriginalPaper

    A bio-inspired distributed algorithm to improve scheduling performance of multi-broker grids

    Antonella Di Stefano, Giovanni Morana Pages 687-700
    Look Inside Get Access

  13. No Access

    OriginalPaper

    A membrane algorithm with quantum-inspired subalgorithms and its application to image processing

    Gexiang Zhang, Marian Gheorghe, Yuquan Li Pages 701-717
    Look Inside Get Access

  14. No Access

    OriginalPaper

    Why ‘GSA: a gravitational search algorithm’ is not genuinely based on the law of gravity

    Melvin Gauci, Tony J. Dodd, Roderich Groß Pages 719-720
    Get Access