Automaton equivalent of the π calculus?

Question

If Turing Machines are the automata equivalent of the $\lambda$ calculus, what is the automaton equivalent of the $\pi$ calculus? I suppose it would be some class of automata that resembled a Turing Machine, but with support for communication channels or signals of some type, but I'm not sure, and would appreciate some direction.

score -1 · Answer 1 · edited Sep 18 '13 at 08:40

-1

The question doesnt make too much sense because the $\pi$-calculus was proven Turing complete, or in other words equivalent to a Turing machine ever since its inception by Milner in 1992. There is a reference on Wikipedia.

edited Sep 18 '13 at 08:40

Juho

22,905
7
63
117

answered Sep 18 '13 at 03:48

vzn

11,162
1
28
52

score -1 · Answer 2 · answered Sep 27 '13 at 21:21

Turing Machines are to the λ-calculus as Chemical Abstract Machines are to the π-calculus.

Basically, a Chemical Abstract Machine is modeled as a set of molecules that, on each process step, some subset of the molecules react, are consumed by the reaction, and produce new molecules.

Automaton equivalent of the π calculus?

2 Answers2