Titlebook: Unconventional Computation and Natural Computation; 11th International C Jérôme Durand-Lose,Nataša Jonoska Conference proceedings 2012 Spri

obsession

Universality and the Halting Problem for Cellular Automata in Hyperbolic Spaces: The Side of the Halthe halting problem in the same settings. This latter problem is very close to that of strong universality. The paper focuses on the halting problem and it can be seen as a preliminary approach to strong universality about cellular automata in hyperbolic spaces.

ARK

EXTOL

P Systems with Minimal Left and Right Insertion and Deletionsystems framework (which corresponds to using specific variants of graph control), computational completeness can even be achieved with the operations of left and right insertion and deletion of only one symbol.

perimenopause

Little

String Matching with Involutionsg antimorphic involutions on some of its factors. When the factors on which these involutions are applied overlap, a linear time algorithm is obtained. When we apply the involutions to non-overlapping factors we obtain an algorithm running in . time and . space, in the worst case. We also improve th

allude

cumulative

Symbol Representations in Evolving Droplet Computersigned a specific task and concentrated on the characteristics of signals representing symbols. Given a Boolean function like Identity, OR, AND, NAND, XOR, XNOR or the half-adder as the target functionality, 2D networks composed of 10×10 droplets were considered in our simulations. Three different se

宽宏大量

Towards a Biomolecular Learning Machinerivial learning and generalisation behaviours, which is a first step towards demonstrating that these behaviours may be realised at the molecular level. The aim of our system is to learn positive real-valued weights for a real-valued linear function of positive inputs. Mathematically, this can be vi

wreathe

乏味