Logic Journal of IGPL Advance Access originally published online on October 5, 2006
Logic Journal of IGPL 2006 14(5):633-647; doi:10.1093/jigpal/jzl003
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
Comparing Computational Power
School of Computer Science, Tel Aviv University, Ramat Aviv, Tel Aviv 69978, Israel. E-mail: udiboker{at}tau.ac.il
School of Computer Science, Tel Aviv University, Ramat Aviv, Tel Aviv 69978, Israel. E-mail: nachumd{at}tau.ac.il
 |
Abstract |
|---|
It is common practice to compare the computational power of different models of computation. For example, the recursive functions are strictly more powerful than the primitive recursive functions, because the latter are a proper subset of the former (which includes Ackermann's function). Side-by-side with this "containment" method of measuring power, it is also standard to base comparisons on "simulation". For example, one says that the (untyped) lambda calculus is as powerful—computationally speaking—as the partial recursive functions, because the lambda calculus can simulate all partial recursive functions by encoding the natural numbers as Church numerals.
The problem is that unbridled use of these two distinct ways of comparing power allows one to show that some computational models (sets of partial functions) are strictly stronger than themselves! We argue that a better definition is that model A is strictly stronger than B if A can simulate B via some encoding, whereas B cannot simulate A under any encoding. We show that with this definition, too, the recursive functions are strictly stronger than the primitive recursive. We also prove that the recursive functions, partial recursive functions, and Turing machines are "complete", in the sense that no injective encoding can make them equivalent to any "hypercomputational" model.1
Key Words: Computational models • computational power • simulation • hypercomputation