3 citations · 3 across the 1 of their papers we have counts for
1 paper
Daowen Qiu
As was well known, in classical computation, Turing machines, circuits, multi-stack machines, and multi-counter machines are equivalent, that is, they can simulate each other in po…