Articolul precedent |
Articolul urmator |
327 0 |
SM ISO690:2012 ALHAZOV, 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), 25-29 iunie 2018, Fontainebleau. Dusseldorf, Germania: Springer Verlag, 2018, Vol. 10867 Ed. a 17-a, pp. 1-15. ISSN 03029743. DOI: https://doi.org/10.1007/978-3-319-92435-9_1 |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin 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, Franța, 25-29 iunie 2018 | ||||||
|
||||||
DOI:https://doi.org/10.1007/978-3-319-92435-9_1 | ||||||
Pag. 1-15 | ||||||
|
||||||
Vezi articolul | ||||||
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 |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Alhazov, A.E.</dc:creator> <dc:creator>Freund, R.</dc:creator> <dc:creator>Ivanov, S.V.</dc:creator> <dc:date>2018</dc:date> <dc:description xml:lang='en'><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 “go beyond Turing”. </p></dc:description> <dc:source>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10867 Ed. a 17-a) 1-15</dc:source> <dc:subject>computational completeness</dc:subject> <dc:subject>non-cooperative</dc:subject> <dc:subject>P systems</dc:subject> <dc:subject>Rules based</dc:subject> <dc:title>P systems with activation and blocking of rules</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>