Results

**1 - 2**of**2**### Expressiveness of the pi-Calculus and the $-Calculus

"... Abstract: In this paper we investigate the expressiveness of two process algebras, the pi-calculus of mobile processes and the $-calculus of bounded rational agents. We demonstrate that both models are more expressive than Turing Machines, i.e., they belong to super-Turing models of computation. In ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract: In this paper we investigate the expressiveness of two process algebras, the pi-calculus of mobile processes and the $-calculus of bounded rational agents. We demonstrate that both models are more expressive than Turing Machines, i.e., they belong to super-Turing models of computation. In particular, they are able to solve the halting problem of the Universal Turing Machine. Additionally, the $-calculus can approximate the solution of the universal search algorithm, and can simulate the pi-calculus, i.e., it is at least equally expressive as the pi-calculus.