%0 Generic %D 2005 %T Towards a programming language in cellular computing %A Miguel A. Gutiérrez-Naranjo %A Mario J. Pérez-Jiménez %A Agustín Riscos-Núñez %C Holanda %K Membrane Computing; Complexity Class; Cellular Subroutine; NP-complete problem %P 93-110 %R 10.1016/j.entcs.2004.04.044 %U http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B75H1-4FJT8PX-J&_user=603129&_coverDate=03%2F01%2F2005&_rdoc=6&_fmt=full&_orig=browse&_srch=doc-info(%23toc%2313109%232005%23998769999%23574761%23FLP%23display%23Volume)&_cdi=13109&_sort=d&_docancho %V 123 %X Several solutions to hard numerical problems using P systems have been presented recently, and strong similarities in their designs have been noticed. In this paper we present a new solution, to the Partition problem, via a family of deterministic P systems with active membranes using 2-division. Then, we intend to show that the idea of a cellular programming language is possible (at least for some relevant family of NP-complete problems), indicating some “subroutines” that can be used in a variety of situations and therefore could be useful for designing solutions for new problems in the future. %> http://www.gcn.us.es/files/Towards a programming language in cellular computing.pdf