Expressiveness of $-Calculus: What Matters? (2000)
| Venue: | Advances in Soft Computing, Proc. of the 9th Intern. Symp. on Intelligent Information Systems IIS'2000, Bystra |
| Citations: | 7 - 6 self |
BibTeX
@INPROCEEDINGS{Eberbach00expressivenessof,
author = {Eugene Eberbach},
title = {Expressiveness of $-Calculus: What Matters?},
booktitle = {Advances in Soft Computing, Proc. of the 9th Intern. Symp. on Intelligent Information Systems IIS'2000, Bystra},
year = {2000},
pages = {145--157},
publisher = {Physica-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
$-calculus is a higher-order polyadic process algebra for resource bounded computation. It has been designed to handle autonomous agents, evolutionary computing, neural nets, expert systems, machine learning, and distributed interactive AI systems, in general. $-calculus has built-in cost-optimization mechanism allowing to deal with nondeterminism, incomplete and uncertain information. In this paper, we investigate expressiveness of $-calculus. We show that due to innitary means, it allows to express models having richer behavior than Turing machine, including cellular automata, interaction machines, neural networks, and random automata networks. We also investigate the importance of synchronization, representation of continuity, and higher-order.
