The week's pick
Reseach Article
Membrane Computing as Multi Turing Machines
| International Journal of Applied Information Systems |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 4 - Number 8 |
| Year of Publication: 2012 |
| Authors: Mahmoud Abdelaziz, Amr Badr, Ibrahim Farag |
10.5120/ijais12-450764
|
Mahmoud Abdelaziz, Amr Badr, Ibrahim Farag . Membrane Computing as Multi Turing Machines. International Journal of Applied Information Systems. 4, 8 ( December 2012), 7-11. DOI=10.5120/ijais12-450764
Abstract
A Turing machine (TM) can be adapted to simulate the logic of any computer algorithm, and is particularly useful in explaining the functions of a CPU inside a computer. Membrane computing aims to develop models and paradigms that are biolog¬ically motivated. It identifies an unconventional computing model, namely a P system, which abstracts from the way living cells process chemical compounds in their compartmental structure. These systems are a class of distributed systems, maxi¬mally parallel computing devices of a biochemical type. In this research, the research tries investigating a new view to show Membrane computing is a multi TM that communicate with each other. The main idea is that each membrane is a TM itself and each TM can communicate with other TM through communication channels under the structure of membranes (tree membranes structure) where membrane (TM) can send and receive string (multiset) to or from other membrane (TM). This TM is a TM with three tapes.
References
- J. Copeland, "The Blackwell Guide to the Philosophy of Computing and Information" Blackwell, 2003.
- G. P?un. "Membrane Computing, Basic ideas, Results, Applications" Pre-Proceeding of First International Workshop on Theory and Application of P Systems, Timisoara (Romania), 2005.
- G. P?un. "Computing with membranes" In Turku University Computer Sci¬ence Research Report No. 208, 1998.
- John Hopcroft, Jeffrey Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley 1979.
- Dina Goldin, Peter Wegner, Persistent Turing Machines, Brown University Technical Report, 1998.
- L. Fernández, F. Arroyo, J. Castellanos. et al (2006) " New Algorithms for Application of Evolution Rules based on Applicability Benchmarks " Las Vegas (USA).
- Tejedor, J, L. Fernández, F. Arroyo, et al (2007) "Algorithm of Active Rules Elimination for Application of Evolution Rules" 8th WSEAS, Vancouver (Canada), 2007.
- C. Li, Validating P system as Distributed Computing Models, master thesis, 2008.
- G. Ciobanu, Distributed Algorithms over Communication Membrane Systems, Bio Systems, 70(2):123-133, 2003.
- Peter Wegner, Interactive Foundations of Computing, Theoretical Computer Science, Feb. 1998.
- Peter Wegner, Dina Goldin, Coinductive Models of Finite Computing Agents, Proc. Coalgebra Workshop (CMCS '99), Electronic Notes in Theoretical Computer Science, Vol. 19, March 1999.
Index Terms
Keywords