﻿ ﻿﻿ P systems with activation and blocking of rules
 Articolul precedent Articolul urmator 119 0 SM ISO690:2012ALHAZOV, Artiom; FREUND, Rudolf; IVANOV, Sergiu. P systems with activation and blocking of rules. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 10867 Ed. a 17-a, 25-29 iunie 2018, Fontainebleau. Dusseldorf, Germania: Springer Verlag, 2018, pp. 1-15. EXPORT metadate: Google Scholar Crossref CERIF DataCiteDublin Core
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Vol. 10867 Ed. a 17-a, 2018
Conferința "17th International Conference on Unconventional Computation and Natural Computation"
Fontainebleau, France, 25-29 iunie 2018

 P systems with activation and blocking of rules
DOI: https://doi.org/10.1007/978-3-319-92435-9_1

Pag. 1-15

 Alhazov Artiom1, Freund Rudolf2, Ivanov Sergiu3 1 Vladimir Andrunachievici Institute of Mathematics and Computer Science,2 Faculty of Informatics, TU Wien,3 IBISC, Universite Evry Disponibil în IBN: 5 septembrie 2021

Rezumat

We introduce new possibilities to control the application of rules based on the preceding applications, which can be defined in a general way for (hierarchical) P systems and the main known derivation modes. Computational completeness can be obtained even with non-cooperative rules and using both activation and blocking of rules, especially for the set modes of derivation. When we allow the application of rules to influence the application of rules in previous derivation steps, applying a non-conservative semantics for what we consider to be a derivation step, we can even “go beyond Turing”.

Cuvinte-cheie
computational completeness, non-cooperative, P systems, Rules based

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Alhazov, A.E.</creatorName>
<affiliation>Institutul de Matematică şi Informatică "Vladimir Andrunachievici", Moldova, Republica</affiliation>
</creator>
<creator>
<creatorName>Freund, R.</creatorName>
<affiliation>Faculty of Informatics, TU Wien, Austria</affiliation>
</creator>
<creator>
<creatorName>Ivanov, S.V.</creatorName>
<affiliation>IBISC, Universite Evry, Franţa</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'><p>P systems with activation and blocking of rules</p></title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2018</publicationYear>
<relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'></relatedIdentifier>
<subjects>
<subject>computational completeness</subject>
<subject>non-cooperative</subject>
<subject>P systems</subject>
<subject>Rules based</subject>
</subjects>
<dates>
<date dateType='Issued'>2018</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Conference Paper</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'><p>We introduce new possibilities to control the application of rules based on the preceding applications, which can be defined in a general way for (hierarchical) P systems and the main known derivation modes. Computational completeness can be obtained even with non-cooperative rules and using both activation and blocking of rules, especially for the set modes of derivation. When we allow the application of rules to influence the application of rules in previous derivation steps, applying a non-conservative semantics for what we consider to be a derivation step, we can even &ldquo;go beyond Turing&rdquo;.&nbsp;</p></description>
</descriptions>
<formats>
<format>uri</format>
</formats>
</resource>