We consider time complexity classes defined on accepting hybrid networks of evolutionary processors (AHNEP) similarly to the classical time complexity class defined on the standard computing model of Turing machine.Expand

A survey of results on the as exact as possible border betweeen a decidable problem and the corresponding undecidablity question in various models of discrete computation: diophantine equations, word problem, Post systems, molecular computations, register machines, neural networks, cellular automata and Turing machines with planar tape.Expand

We consider a class of insertion-deletion systems which have not been investigated so far, those without any context controlling the insertion-Deletion operations.Expand

This paper gives an application of the new methodology introduced by Yaroslav Sergeyev in his seminal papers, see [17, 18, 19], to the study of a family of tilings of the hyperbolic plane.Expand

We define a kind of cellular automaton called a hexagonal partitioned cellular Automaton (HPCA), and study logical universality of a reversible HPCA.Expand

We continue the investigation of P colonies, a class of abstract computing devices composed of very simple agents (computational tools), acting and evolving in a shared environment.Expand

This paper considers a generalization of various communication models based on the P system paradigm where two objects synchronously move across components.Expand

We prove that the general tiling problem of the hyperbolic plane is undecidable by proving a slightly stronger version using only a regular polygon as the basic shape of the tiles.Expand

In this paper, we look at extended splicing systems (i.e., H systems) in to find how small such a system can be in order to generate a recursively enumerable language.Expand