Tag Archives: Natural Computing

Spatial search using the discrete time quantum walk

Abstract  We study the quantum walk search algorithm of Shenvi et al. (Phys Rev A 67:052307, 2003) on data structures of one to two spatial dimensions, on which the algorithm is thought to be less efficient than in three
or more spatial dime… Continue reading

Tagged | Comments Off

Sequential and maximally parallel multiset rewriting: reversibility and determinism

Abstract  We study reversibility and determinism aspects and the strong versions of these properties of sequential multiset processing
systems and of maximally parallel systems, from the computability point of view. In the sequential case, s… Continue reading

Tagged | Comments Off

Designing a new software tool for Digital Imagery based on P systems

Abstract  In this paper we present a new software tool for dealing with the problem of segmentation in Digital Imagery. The implementation
is inspired in the design of a tissue-like P system which solves the problem in constant time due the … Continue reading

Tagged | Comments Off

A survey of recursive analysis and Moore’s notion of real computation

Abstract  The theory of analog computation aims at modeling computational systems that evolve in a continuous space. Unlike the situation
with the discrete setting there is no unified theory of analog computation. There are several proposed … Continue reading

Tagged | Comments Off

Preface

Preface
Content Type Journal ArticlePages 1-1DOI 10.1007/s11047-011-9283-8Authors
Olivier Bournez, École polytechnique, Paris, FranceGilles Dowek, INRIA, Paris, France

Journal Natural ComputingOnline ISSN 1572-9796Print ISSN 1567-7818

Continue reading

Tagged | Comments Off

Editorial for special issue on unconventional computation

Editorial for special issue on unconventional computation
Content Type Journal ArticlePages 1-2DOI 10.1007/s11047-011-9273-xAuthors
Jon Timmis, Department of Computer Science, University of York, York, UKKenichi Morita, Department of Information Eng… Continue reading

Tagged | Comments Off

Partitioned quantum cellular automata are intrinsically universal

Abstract  There have been several non-axiomatic approaches taken to define quantum cellular automata (QCA). Partitioned QCA (PQCA) are
the most canonical of these non-axiomatic definitions. In this work we show that any QCA can be put into t… Continue reading

Tagged | Comments Off

Comparing simulation algorithms for multienvironment probabilistic P systems over a standard virtual ecosystem

Abstract  Membrane Computing has recently proved to be a suitable framework for addressing the modelling of dynamical biological systems
in general, and ecosystems in particular. Due to the inherent randomness and uncertainty in biological s… Continue reading

Tagged | Comments Off

Membrane system models for super-Turing paradigms

Abstract  We extend Calude and Păun’s accelerating P system model of computation, and investigate the computational power of the resulting
systems. We show that the resulting systems can solve problems at all levels of the arithmetical hi… Continue reading

Tagged | Comments Off

Emergence of synchronicity in a self-organizing spiking neuron network: an approach via genetic algorithms

Abstract  Based on the Theory of Neuronal Group Selection (TNGS), we have investigated the emergence of synchronicity in a network composed
of spiking neurons via genetic algorithm. The TNGS establishes that a neuronal group is the most basi… Continue reading

Tagged | Comments Off