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 infinitary 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.
research partially supported by a grant from NSERC No. OGP0046501
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Burks A. (1970) Essays on Cellular Automata, Univ. of Illinois Press.
Church A. (1941) The Calculi of Lambda Conversion, Princeton, N.J., Princeton University Press.
Dean T., Boddy M. (1988) An Analysis of Time-Dependent Planning, in Proc. Seventh National Conf. on Artificial Intelligence, Minneapolis, Minnesota, 4954.
Eberbach E. (1994) SEMAL: A Cost Language Based on the Calculus of Self-modifiable Algorithms, Intern. Journal of Software Engineering and Knowledge Engineering, vol. 4, no. 3, 391–408.
Eberbach E. (1997) A Generic Tool for Distributed AI with Matching as Message Passing, Proc. of the Ninth IEEE Intern. Conf. on Tools with Artificial Intelligence TAI’97, Newport Beach, California, 11–18.
Eberbach E. (1997) Enhancing Genetic Programming by $-calculus, Proc. of the Second Annual Genetic Programming Conference GP-97, Morgan Kaufmann, Stanford University, 1997, 88 (a complete version in Proc. of the Tenth Australian Joint Conf. on Artificial Intelligence AI’97, The ACS National Committee on AI and ES, Perth, Australia, 1997, 77–83 ).
Eberbach E., Brooks R. (1999) $-Calculus: Flexible Optimization and Adaptation under Bounded Resources in Real-Time Complex Systems, Applied Research Laboratory, The Pennsylvania State University.
Eberbach E., Brooks R., Phoha. S. (1999) Flexible Optimization and Evolution of Underwater Autonomous Agents, in: New Directions in Rough Sets, Data Mining, and Granular-Soft Computing, Proc. of the 7th Intern. Workshop on Rough Sets, Fuzzy Sets, Data Mining and Granular-Soft Computing RSFDGrC’99, Yamaguchi, Japan, LNAI 1711, Springer-Verlag, 519–527.
Eberbach E., Phoha S. (1999) SAMON: Communication, Cooperation and Learning of Mobile Autonomous Robotic Agents, Proc. of the 11th IEEE Intern. Conf. on Tools with Artificial Intelligence ICTAI’99, Chicago, IL, 229–236.
Francez N., Stomp F.A. (1993) A Proof System for Asynchronously Communicating Sequential Processes, Dept. of Computer Science, Technion - Israel Institute of Technology, Tech. Rep. #772.
Garvey A., Lesser V. (1993) Design-to-Time Real-Time Scheduling, IEEE Transactions on Systems, Man, and Cybernetics, 23 (6), 1491–1502.
Garzon M. (1995) “Models of Massive Parallelism: Analysis of Cellular Automata and Neural Networks”, Springer-Verlag.
Goldin D. (2000) Persistent Turing Machines as a Model of Interactive Computation, FoIKS’00, Cottbus, Germany (also http://www.cs.umb.edu/-dqg ).
Horvitz E. (1987) Reasoning about Beliefs and Actions under Computational Resources Constraints, in Proc. of the 1987 Workshop on Uncertainty in Artificial Intelligence, Seattle, Washington.
Koiran P., Cosnard M., Garzon M. (1994) Computability With Low-Dimensional Dynamical Systems, Theoretical Computer Science, 132, 113–128.
Liu J.W.S., Lin K.J., Shih W.K., Yu A.C., Chung J.Y., Zhao W. (1991) Algorithms for Scheduling Imprecise Computations, IEEE Computer, 24, 58–68.
Milner R. (1980) A Calculus of Communicating Systems, Lect. Notes in Computer Science vol.94, Springer-Verlag.
Milner R., Parrow J., Walker D. (1992) A Calculus of Mobile Processes, I & II, Information and Computation 100, 1–77.
Milner R. (1992) The Polyadic 7r-Calculus: A Tutorial, in F.L.Bauer,W.Brauer (eds.) Logic and Algebra of Specification, Springer-Verlag, 203–246.
Milner R. (1993) Elements of Interaction, CACM, vol. 36, no. 1, 78–89.
Palamidessi C. (1997) Comparing the Expressive Power of the Synchronous and the Asynchronous a-calculus, Proc. of the 24th ACM Symp. on Principles of Programming Languages ( POPL ), ACM, 256–265.
Russell S., Norvig P. (1995) Artificial Intelligence: A Modern Approach, Prentice-Hall.
Sangiorgi D. (1992) Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, Ph.D.Thesis, Dept. of Computer Science, Univ. of Edinburgh.
Wegner P. (1997) Why Interaction is More Powerful Than Algorithms, CACM, vol. 40, no. 5, 81–91.
Wegner P. (1997) Interactive Software Technology, in: The Computer Science and Engineering Handbook (ed. A.B. Tucker Jr. ), CRC Press, 2440–2463.
Wegner P. (1997) Interactive Foundations of Computing, Theoretical Computer Science (also http://www.cs.brown.edu/people/pw ).
Wegner P., Goldin D. (1999) Coinductive Models of Finite Computing Agents, Electronic Notes in Theoretical Computer Science, vol.19 (alsohttp://www.cs.umb.edu/dqg).
Wegner P., Goldin D. (1999) Interaction, Computability, and Church’s Thesis, Accepted to the British Computer Journal (also http://www.cs.umb.edu/-dqg ).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Physica-Verlag Heidelberg
About this paper
Cite this paper
Eberbach, E. (2000). Expressiveness of $-Calculus: What Matters?. In: Intelligent Information Systems. Advances in Soft Computing, vol 4. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1846-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1846-8_14
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-1309-8
Online ISBN: 978-3-7908-1846-8
eBook Packages: Springer Book Archive