Turing Incompleteness of Asynchronous P Systems with Active Membranes

dc.creator	Leporati, Alberto
dc.creator	Manzoni, Luca
dc.creator	Porreca, Antonio E.
dc.date.accessioned	2016-02-02T09:26:16Z
dc.date.available	2016-02-02T09:26:16Z
dc.date.issued	2013
dc.identifier.isbn	978-84-940691-9-2	es
dc.identifier.uri	http://hdl.handle.net/11441/33791
dc.description.abstract	We prove that asynchronous P systems with active membranes without divi- sion rules can be simulated by place/transition Petri nets, and hence are computationally weaker than Turing machines. This result holds even if the synchronisation mechanisms provided by electrical charges and membrane dissolution are exploited.	es
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.publisher	Fénix Editora	es
dc.relation.ispartof	Proceedings of the Eleventh Brainstorming Week on Membrane Computing, 165-176. Sevilla, E.T.S. de Ingeniería Informática, 4-8 de Febrero, 2013,	es
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.title	Turing Incompleteness of Asynchronous P Systems with Active Membranes	es
dc.type	info:eu-repo/semantics/conferenceObject	es
dc.type.version	info:eu-repo/semantics/publishedVersion	es
dc.rights.accessrights	info:eu-repo/semantics/openAccess
dc.identifier.idus	https://idus.us.es/xmlui/handle/11441/33791

Files	Size	Format	View	Description
165_leporati_manzoni.pdf	157.8Kb	[PDF]	View/Open

Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional