Accepting networks of genetic processors are computationally complete (Q714860): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2012.06.028 / rank
Normal rank
 
Property / author
 
Property / author: Jose M. Sempere / rank
Normal rank
 
Property / author
 
Property / author: Jose M. Sempere / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Genocop / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999436197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2780162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks of evolutionary processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The role of evolutionary operations in accepting hybrid networks of evolutionary processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Networks of Evolutionary Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accepting networks of splicing processors: complexity results / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Computational Paradigms / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accepting splicing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membrane computing. An introduction. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223673 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2012.06.028 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:44, 10 December 2024

scientific article
Language Label Description Also known as
English
Accepting networks of genetic processors are computationally complete
scientific article

    Statements

    Accepting networks of genetic processors are computationally complete (English)
    0 references
    0 references
    0 references
    11 October 2012
    0 references
    parallel genetic algorithms
    0 references
    networks of biologically-inspired processors
    0 references
    computational completeness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references