Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

SYNASC

2005

IEEE

2005

IEEE

We consider P colonies as introduced in [4] and investigate their computational power when working in the maximally parallel and in the sequential mode. It turns out that there is a trade-o¤between maximal parallelism and checking programs: Using checking programs (i.e., priorities on the communicaton rules in the programs of the agents), P colonies working in the sequential mode with height at most 5 are computationally complete, whereas when working in the maximally parallel mode, P colonies (again with height 5) already obtain the same computational power without using checking programs. Moreover, when allowing an arbitrary number of programs for each agent, we can prove that P colonies with only one agent (thus these P colonies are working in the sequential mode) are already computationally complete. Finally, P colonies with an arbitrary number of agents working in the sequential mode as well as even P colonies with only one agent using an arbitrary number of non-checking program...

Added |
25 Jun 2010 |

Updated |
25 Jun 2010 |

Type |
Conference |

Year |
2005 |

Where |
SYNASC |

Authors |
Rudolf Freund, Marion Oswald |

Comments (0)