Expression of Turing Machines by Pi Calculus
Guo Xiao-qun · Computer Engineering and Science · 2009
In order to study the expressiveness of the Pi calculus,we try to use it to express Turing machines.The results show that as long as a certain extension is made,i.e.introducing some function symbols and allowing the names for certain operations,you can use the reductions of pi calculus to express the computing process of Turing machines.