Affiliation:
1. Department of Computer Science University of Rzeszόw, ul. Pigonia 1, Rzeszόw , Poland
2. Department of Cognitive Science University of Information Technology and Management, ul. Sucharskiego 2, Rzeszόw , Poland
Abstract
Abstract
We define games on the medium of plasmodia of slime mould, unicellular organisms that look like giant amoebae. The plasmodia try to occupy all the food pieces they can detect. Thus, two different plasmodia can compete with each other. In particular, we consider game-theoretically how plasmodia of Physarum polycephalum and Badhamia utricularis fight for food. Placing food pieces at different locations determines the behavior of plasmodia. In this way, we can program the plasmodia of Physarum polycephalum and Badhamia utricularis by placing food, and we can examine their motion as a Physarum machine-an abstract machine where states are represented as food pieces and transitions among states are represented as movements of plasmodia from one piece to another. Hence, this machine is treated as a natural transition system. The behavior of the Physarum machine in the form of a transition system can be interpreted in terms of rough set theory that enables modeling some ambiguities in motions of plasmodia. The problem is that there is always an ambiguity which direction of plasmodium propagation is currently chosen: one or several concurrent ones, i.e., whether we deal with a sequential, concurrent or massively parallel motion. We propose to manage this ambiguity using rough set theory. Firstly, we define the region of plasmodium interest as a rough set; secondly, we consider concurrent transitions determined by these regions as a context-based game; thirdly, we define strategies in this game as a rough set; fourthly, we show how these results can be interpreted as a Go game.
Subject
Applied Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference30 articles.
1. Abramsky, S. and Jagadeesan, R. (1994). Games and full completeness for multiplicative linear logic, The Journal of Symbolic Logic 59(2): 543-574.
2. Abramsky, S. and Mellies, P.-A. (1999). Concurrent games and full completeness, Proceedings of the 14th Symposium on Logic in Computer Science, Trento, Italy, pp. 431-442.
3. Aczel, P. (1988). Non-Well-Founded Sets, Cambridge University Press, Cambridge.
4. Adamatzky, A. (2007a). Physarum machine: Implementation of a Kolmogorov-Uspensky machine on a biological substrate, Parallel Processing Letters 17(04): 455-467.
5. Adamatzky, A. (2007b). Physarum machines: Encapsulating reaction-diffusion to compute spanning tree, Die Naturwissenschaften 94(12): 975-980.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献