PDA with N-Stacks comparison with Turing Machines

Question

Is it possible to compare PDA having N-Stacks with Turning Machines. Are they equally powerful in this situation?

It's been told that PDA with 2-Stacks is equally powerful to Turning Machine. But what if we add more stacks i.e. 3, 4, 5...N to PDA; will it become more powerful or it can serve same purpose.

The same question was posted earlier today, and marked as a duplicate. — Raphael, Feb 23 '15 at 11:09
What about more than 2-stacks addition to PDA. I'm unable to find this information on the forum — Ahmed Faraz, Feb 23 '15 at 11:48

score 0 · Accepted Answer · answered Feb 23 '15 at 10:15

0

2 stacks is enough for a PDA to be as powerful as a Turing Machine. Basically, you can pop from one stack and push into the other to simulate moving across the tape head, writing, etc.

In fact, a 2-counter machine is as powerful as a Turing Machine, though the proof is much more involved. There's a sketch of it on Wikipedia

answered Feb 23 '15 at 10:15

Joey Eremondi

29,754
5
64
121

What if we add more stacks (3,4,5,...N) to PDA – Ahmed Faraz Feb 23 '15 at 11:49
For computability? Nothing. We know of no models more powerful than Turing Machines. – Joey Eremondi Feb 23 '15 at 13:02

PDA with N-Stacks comparison with Turing Machines

1 Answers1