A solution to the only one object problem with dissolution rules

In the framework of membrane computing, (non-)uniform families of recognizer membrane systems are usually defined to solve abstract decision problems. In this sense, the use of finite resources for each member of the family makes the difference with respect to Turing machines solving these problems....

Full description

Saved in:
Bibliographic Details
Published in:Journal of membrane computing Vol. 6; no. 2; pp. 101 - 108
Main Authors: Caselmann, Julien, Orellana-Martín, David
Format: Journal Article
Language:English
Published: Singapore Springer Nature Singapore 01.06.2024
Springer Nature B.V
Subjects:
Artificial Intelligence
Coding
Complexity theory
Computation by Abstract Devices
Computational Biology/Bioinformatics
Computer Science
Membranes
Optimization
Polynomials
Research Paper
Set theory
Theory of Computation
Turing machines
Computational complexity theory
Membrane computing
Only one object problem
ISSN:2523-8906, 2523-8914
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the framework of membrane computing, (non-)uniform families of recognizer membrane systems are usually defined to solve abstract decision problems. In this sense, the use of finite resources for each member of the family makes the difference with respect to Turing machines solving these problems. While keeping the finite nature of these systems, it is interesting to know which type of problems can be solved by means of a single membrane system. For this purpose, the complexity class PMC R 1 p was defined as the class of problems that can be solved by means of a single membrane system in polynomial time. Due to the polynomial-time encoding of the input, at least all the problems from P can be solved with a trivial system. To go below P , the class PMC R 1 f restricts the definition of this encoding. In this work, we study the capability of different types of membrane systems to solve the ONLY-ONE-OBJECT problem, while having the encoding restriction.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2523-8906
2523-8914
DOI:10.1007/s41965-024-00150-3