Results 1 
9 of
9
Further open problems in membrane computing, Brainstorming Week on Membrane Computing
 Sevilla University
, 2004
"... Abstract. A series of open problems and research topics in membrane computing are pointed out, most of them suggested by recent developments in this area. Many of these problems have several facets and branchings, and further facets and branchings can surely be found after addressing them in a more ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract. A series of open problems and research topics in membrane computing are pointed out, most of them suggested by recent developments in this area. Many of these problems have several facets and branchings, and further facets and branchings can surely be found after addressing them in a more careful manner. 1
Tracing Some Open Problems in Membrane Computing
"... Abstract. Membrane computing is a branch of natural computing aiming to abstract computing models from the structure and functioning of the living cell, and from the way cells cooperate in tissues, organs, or other populations of cells. This research area developed very fast, both at the theoretical ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. Membrane computing is a branch of natural computing aiming to abstract computing models from the structure and functioning of the living cell, and from the way cells cooperate in tissues, organs, or other populations of cells. This research area developed very fast, both at the theoretical level and in what concerns the applications. During the almost ten years since membrane computing was initiated, several open problems were circulated, sometimes in comprehensive lists prepared for meetings in this area. The present notes intend to survey the research related to some of these problems, mentioning both progresses made in solving them and questions which still wait for research efforts.
Computing with Cells and Atoms: After Five Years
 CDMTCS Research Report Series, CDMTCS246, 2004, available at http://www.cs.auckland.ac.nz/CDMTCS/researchreports/246cris.pdf
, 2004
"... This is the text added to the Russian edition of our book Computing with Cells and Atoms (Taylor & Francis Publishers, London, 2001) to be published by Pushchino Publishing House. The translation was done by Professor Victor Vladimirovich Ivanov and Professor Robert Polozov. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This is the text added to the Russian edition of our book Computing with Cells and Atoms (Taylor & Francis Publishers, London, 2001) to be published by Pushchino Publishing House. The translation was done by Professor Victor Vladimirovich Ivanov and Professor Robert Polozov.
ACCELERATING MACHINES
, 2006
"... This paper presents an overview of accelerating machines. We begin by exploring the history of the accelerating machine model and the potential power that it provides. We look at some of the problems that could be solved with an accelerating machine, and review some of the possible implementation me ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper presents an overview of accelerating machines. We begin by exploring the history of the accelerating machine model and the potential power that it provides. We look at some of the problems that could be solved with an accelerating machine, and review some of the possible implementation methods that have been presented. Finally, we expose the limitations of accelerating machines and conclude by posing some problems for further research.
Vaszil: Editing configurations of P systems
 In the present volume
"... Summary. This paper proposes and preliminarily investigates the possibility of transforming a configuration (membrane structure and multisets of symbolobjects present in the compartments of this membrane structure) of a P system into another configuration, by means of a given set of rules acting bo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Summary. This paper proposes and preliminarily investigates the possibility of transforming a configuration (membrane structure and multisets of symbolobjects present in the compartments of this membrane structure) of a P system into another configuration, by means of a given set of rules acting both on the membranes and on the multisets of objects. Although such a transformation can be obtained during a computation of a P system, we consider it as a goal per se, as a precomputation phase, when the system itself is built. In this framework, several important topics appear, such as the editdistance between configurations (with respect to a given set of editing rules; actually, this is a weak metric, because it is not necessarily symmetric), normal forms, reachability, existence of single configurations from which a given family of configurations can be constructed, etc. We investigate here only a few of these questions; the paper is mainly devoted to formulating problems in the new framework, calling attention to the possible extensions and usefulness of the present approach. 1
Computations with Uncertain Time Constraints: Effects on Parallelism and Universality
, 2008
"... It is known that there exist computational problems that can be solved on a parallel computer, yet are impossible to be solved sequentially. Specifically, no general purpose sequential model of computation, such as the Turing Machine or the Random Access Machine, can simulate a large family of compu ..."
Abstract
 Add to MetaCart
It is known that there exist computational problems that can be solved on a parallel computer, yet are impossible to be solved sequentially. Specifically, no general purpose sequential model of computation, such as the Turing Machine or the Random Access Machine, can simulate a large family of computations (for example, solutions to certain realtime problems), each of which is capable of being carried out readily by a particular parallel computer. We extend the scope of such problems to the class of problems with uncertain time constraints. The first type of time constraints refers to uncertain time requirements on the input data, that is, when and for how long are the input data available. A second type of time constraints refers to uncertain deadlines for tasks. Our main objective is to exhibit computational problems in which it is very difficult to find out (read ‘compute’) what to do and when to do it. Furthermore, problems with uncertain time constraints, as described here, prove once more that it is impossible to define a ‘universal computer’, that is, a computer able to compute all computable functions. Finally, one of the contributions of this paper is to promote the study of a topic, conspicuously absent to date from theoretical computer science, namely, the role of physical time and physical space in computation. The focus of our work is to analyze the effect of external natural phenomena on the various components of a computational process, namely, the input phase, the calculation phase (including the algorithm and the computing agents themselves), and the output phase.
TimeSensitive Computational Models with a Dynamic Time Component
"... It is known that a parallel computer can solve problems that are impossible to be solved sequentially. That is, any general purpose sequential model of computation, such as the Turing machine or the random access machine (RAM), cannot simulate certain computations, for example solutions to realtime ..."
Abstract
 Add to MetaCart
It is known that a parallel computer can solve problems that are impossible to be solved sequentially. That is, any general purpose sequential model of computation, such as the Turing machine or the random access machine (RAM), cannot simulate certain computations, for example solutions to realtime problems, that are carried out by a specific parallel computer. This paper extends the scope of such problems to the class of problems with uncertain time constraints. The first type of time constraints refers to uncertain time requirements on the input data, that is when and for how long are input data available. A second type of time constraints refers to uncertain deadlines for tasks. The main contribution of this paper is to exhibit computational problems in which itisvery difficult to find out (read compute) what to do and when to do it. Furthermore, problems with uncertain time constraints, as described in this paper, prove once more, that it is impossible to define a universal computer, that is, a computer able to simulate all computable functions.
New Cybernetics and the Application of its Principles in Physics Oleg Kupervasser Transist Video LLC
"... We describe principles of new cybernetics and use these principles for resolution of basic physical paradoxes. It demonstrates universality of the principles of new cybernetics. ..."
Abstract
 Add to MetaCart
We describe principles of new cybernetics and use these principles for resolution of basic physical paradoxes. It demonstrates universality of the principles of new cybernetics.
Membrane Systems Working in Generating and Accepting Modes: Expressiveness and Encodings
"... Abstract. Membrane systems can be seen either as generators or as acceptors of multiset languages. In this paper we compare the expressive power of membrane systems working in accepting mode with that of membrane systems working in generating mode. Features like determinism, presence of promoters an ..."
Abstract
 Add to MetaCart
Abstract. Membrane systems can be seen either as generators or as acceptors of multiset languages. In this paper we compare the expressive power of membrane systems working in accepting mode with that of membrane systems working in generating mode. Features like determinism, presence of promoters and of cooperative rules are considered. The comparison between some of the considered classes of membrane systems is carried out by defining encodings of one class into another. 1