- -

Complexity-preserving simulations among three variants of accepting networks of evolutionary processors

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

Complexity-preserving simulations among three variants of accepting networks of evolutionary processors

Mostrar el registro sencillo del ítem

Ficheros en el ítem

dc.contributor.author Bottoni ., Paolo es_ES
dc.contributor.author Labella ., Anna es_ES
dc.contributor.author Manea ., Florin es_ES
dc.contributor.author Mitrana, Víctor es_ES
dc.contributor.author Petre ., Ion es_ES
dc.contributor.author Sempere Luna, José María es_ES
dc.date.accessioned 2014-03-06T13:59:24Z
dc.date.issued 2011-03
dc.identifier.issn 1567-7818
dc.identifier.uri http://hdl.handle.net/10251/36241
dc.description.abstract In this paper we consider three variants of accepting networks of evolutionary processors. It is known that two of them are equivalent to Turing machines. We propose here a direct simulation of one device by the other. Each computational step in one model is simulated in a constant number of computational steps in the other one while a translation via Turing machines squares the time complexity. We also discuss the possibility of constructing simulations that preserve not only complexity, but also the shape of the simulated network. © 2011 Springer Science+Business Media B.V. es_ES
dc.description.sponsorship This work was supported by the Academy of Finland, projects 132727, 122426, and 108421. F. Manea acknowledges the support from the Alexander von Humboldt Foundation. J Sempere acknowledges the support from the Spanish Ministerio de Educacion y Ciencia project TIN2007-60769. en_EN
dc.format.extent 17 es_ES
dc.language Inglés es_ES
dc.publisher Springer Verlag (Germany) es_ES
dc.relation.ispartof Natural Computing es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Evolutionary processor es_ES
dc.subject Filtered connection es_ES
dc.subject Network of evolutionary processors es_ES
dc.subject Uniform evolutionary processor es_ES
dc.subject Computer network es_ES
dc.subject Conference paper es_ES
dc.subject Mathematical model es_ES
dc.subject Microprocessor es_ES
dc.subject.classification LENGUAJES Y SISTEMAS INFORMATICOS es_ES
dc.title Complexity-preserving simulations among three variants of accepting networks of evolutionary processors es_ES
dc.type Artículo es_ES
dc.embargo.lift 10000-01-01
dc.embargo.terms forever es_ES
dc.identifier.doi 10.1007/s11047-010-9238-5
dc.relation.projectID info:eu-repo/grantAgreement/AKA//108421/FI/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/AKA//132727/FI/Networks of cell-like processors: computation, complexity, simulation and implementation/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/AKA//122426/FI/Computational models for the heat shock response in eukaryotic cells/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/MEC//TIN2007-60769/ES/TECNICAS DE INFERENCIA GRAMATICAL Y APLICACION AL PROCESAMIENTO DE BIOSECUENCIAS/ es_ES
dc.rights.accessRights Cerrado es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació es_ES
dc.description.bibliographicCitation Bottoni ., P.; Labella ., A.; Manea ., F.; Mitrana, V.; Petre ., I.; Sempere Luna, JM. (2011). Complexity-preserving simulations among three variants of accepting networks of evolutionary processors. Natural Computing. 10(1):429-445. https://doi.org/10.1007/s11047-010-9238-5 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://link.springer.com/article/10.1007/s11047-010-9238-5 es_ES
dc.description.upvformatpinicio 429 es_ES
dc.description.upvformatpfin 445 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 10 es_ES
dc.description.issue 1 es_ES
dc.relation.senia 217329
dc.contributor.funder Ministerio de Educación y Ciencia es_ES
dc.contributor.funder Academy of Finland es_ES
dc.contributor.funder Alexander von Humboldt Foundation es_ES
dc.description.references Alhazov A, Bel Enguix G, Rogozhin Y (2009a) Obligatory hybridnetworks of evolutionary processors. In: International conference on agents and artificial intelligence (ICAART 2009), pp 613–618 es_ES
dc.description.references Alhazov A, Csuhaj-Varj E, Martn-Vide C, Rogozhin Y (2009b) On the size of computationally complete hybrid networks ofevolutionaryprocessors. Theor Comput Sci 410:3188–3197 es_ES
dc.description.references Bottoni P, Labella A, Manea F, Mitrana V, Sempere J (2009a) Filter position in networks of evolutionary processors does not matter: a direct proof. In: Proc. 15th international meeting on DNA computing and molecular programming. 8–11 June 2009, Fayetteville, Arkansas es_ES
dc.description.references Bottoni P, Labella A, Mitrana V, Sempere JM (2009b) Networks of evolutionary picture processors with filtered connections. In: Unconventional computation, 8th international conference (UC 2009), LNCS, vol 5715. Springer, Heidelberg, pp 70–84 es_ES
dc.description.references Castellanos J, Martín-Vide C, Mitrana V, Sempere J (2001) Solving NP-complete problems with networks of evolutionary processors. In: International work-conference on artificial and natural neural networks (IWANN 2001), Lecture notes in computer science, vol 2084, pp 621–628 es_ES
dc.description.references Csuhaj-Varjú E, Mitrana V (2000) Evolutionary systems: a language generating device inspired by evolving communities of cells. Acta Inform 36:913–926 es_ES
dc.description.references Csuhaj-Varjú E, Salomaa A (1997) Networks of parallel language processors. In: New trends in formal languages, Lecture notes in computer science, vol 1218, pp 299–318 es_ES
dc.description.references Dassow J, Truthe B (2007) On the power of networks of evolutionary processors. In: Machines, computations, and universality (MCU 2007), Lecture notes in computer science, vol 4667, pp 158–169 es_ES
dc.description.references Drăgoi C, Manea F (2008) On the descriptional complexity of accepting networks of evolutionary processors with filtered connections. Int J Found Comput Sci 19:1113–1132 es_ES
dc.description.references Drăgoi C, Manea F, Mitrana V (2007) Accepting networks of evolutionary processors with filtered connections. J Univers Comput Sci 13:1598–1614 es_ES
dc.description.references Errico L, Jesshope C (1994) Towards a new architecture for symbolic processing. In: Artificial intelligence and information-control systems of robots ’94, World Scientific, Singapore, pp 31–40 es_ES
dc.description.references Fahlman SE, Hinton GE, Seijnowski TJ (1983) Massively parallel architectures for AI: NETL, THISTLE and Boltzmann machines. In: Proc. of the national conference on artificial intelligence, pp 109–113 es_ES
dc.description.references Hillis W (1985) The connection machine. MIT Press, Cambridge es_ES
dc.description.references Manea F, Martin-Vide C, Mitrana V (2007) On the size complexity of universal accepting hybrid networks of evolutionary processors. Math Struct Comput Sci 17:753–771 es_ES
dc.description.references Margenstern M, Mitrana V, Perez-Jimenez M (2005) Accepting hybrid networks of evolutionary systems. In: DNA based computers 10, Lecture notes in computer science, vol, pp 235–246 es_ES
dc.description.references Martín-Vide C, Mitrana V (2005) Networks of evolutionary processors: results and perspectives. In: Molecular computational models: unconventional approaches. dea Group Publishing, Hershey, pp 78–114 es_ES
dc.description.references Păun G (2000) Computing with membranes. J Comput Syst Sci 61:108–143 es_ES
dc.description.references Păun G, Sântean L (1989) Parallel communicating grammar systems: the regular case. Ann Univ Bucharest Ser Matematica Inform 38:55–63 es_ES
dc.description.references Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages. Springer–Verlag, Berlin es_ES
dc.description.references Sankoff D et al. (1992) Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. Proc Natl Acad Sci USA 89:6575–6579 es_ES


Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem