Ludek Cienciala, Lucie Ciencialová, Miroslav Langer
{"title":"容量为1的P群与模块化","authors":"Ludek Cienciala, Lucie Ciencialová, Miroslav Langer","doi":"10.4018/jncr.2011040103","DOIUrl":null,"url":null,"abstract":"In this paper, the authors continue the investigation of P colonies introduced in Kelemen, KelemenovAi, and Paun (2004). This paper examines a class of abstract computing devices composed of independent agents, acting and evolving in a shared environment. The first part is devoted to the P colonies of the capacity one. The authors present improved results concerning the computational power of the P colonies with capacity one and without using checking programs. The second part of the paper examines the modularity of the P colonies. The authors then divide the agents into modules.","PeriodicalId":369881,"journal":{"name":"Int. J. Nat. Comput. Res.","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"P Colonies of Capacity One and Modularity\",\"authors\":\"Ludek Cienciala, Lucie Ciencialová, Miroslav Langer\",\"doi\":\"10.4018/jncr.2011040103\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the authors continue the investigation of P colonies introduced in Kelemen, KelemenovAi, and Paun (2004). This paper examines a class of abstract computing devices composed of independent agents, acting and evolving in a shared environment. The first part is devoted to the P colonies of the capacity one. The authors present improved results concerning the computational power of the P colonies with capacity one and without using checking programs. The second part of the paper examines the modularity of the P colonies. The authors then divide the agents into modules.\",\"PeriodicalId\":369881,\"journal\":{\"name\":\"Int. J. Nat. Comput. Res.\",\"volume\":\"89 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Nat. Comput. Res.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/jncr.2011040103\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Nat. Comput. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/jncr.2011040103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
摘要
本文继续对Kelemen, KelemenovAi, and Paun(2004)引种的P菌落进行调查。本文研究了一类由独立代理组成的抽象计算设备,它们在共享环境中活动和进化。第一部分是容量1的P群。在不使用校验程序的情况下,提出了容量为1的P群计算能力的改进结果。第二部分研究了P群的模块化问题。然后,作者将代理划分为模块。
In this paper, the authors continue the investigation of P colonies introduced in Kelemen, KelemenovAi, and Paun (2004). This paper examines a class of abstract computing devices composed of independent agents, acting and evolving in a shared environment. The first part is devoted to the P colonies of the capacity one. The authors present improved results concerning the computational power of the P colonies with capacity one and without using checking programs. The second part of the paper examines the modularity of the P colonies. The authors then divide the agents into modules.