Repositorio de producción científica de la Universidad de Sevilla

The Computational Complexity of Uniformity and Semi-uniformity in Membrane Systems

Opened Access The Computational Complexity of Uniformity and Semi-uniformity in Membrane Systems
Estadísticas
Icon
Exportar a
Autor: Murphy, Niall
Woods, Damien
Fecha: 2009
Publicado en: Proceedings of the Seventh Brainstorming Week on Membrane Computing, vol.II, 73-84. Sevilla, E.T.S. de Ingeniería Informática, 2-6 de Febrero, 2009
ISBN/ISSN: 9788461328369
Tipo de documento: Ponencia
Resumen: We investigate computing models that are presented as families of finite computing devices with a uniformity condition on the entire family. Examples include circuits, membrane systems, DNA computers, cellular automata, tile assembly systems, and so on. However, in this list there are actually two distinct kinds of uniformity conditions. The first is the most common and well-understood, where each input length is mapped to a single computing device that computes on the finite set of inputs of that length. The second, called semi-uniformity, is where each input is mapped to a computing device for that input. The former notion is well-known and used in circuit complexity, while the latter notion is frequently found in literature on nature-inspired computing models, from the past 20 years or so. Are these two notions distinct or not? For many models it has been found that these notion are in fact the same, in the sense that the choice of uniformity or semi-uniformity leads to...
[Ver más]
Tamaño: 211.4Kb
Formato: PDF

URI: http://hdl.handle.net/11441/38904

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones