The $\pi$-Calculus is Behaviourally Complete and Orbit-Finitely Executable

Bas Luttik, Fei Yang

Reactive Turing machines extend classical Turing machines with a facility to model observable interactive behaviour. We call a behaviour (finitely) executable if, and only if, it i…