Static Computation of Polynomial-time Functions in C++,

We investigate the computational power of C++ compilers. In particular, it is known that any partial recursive function can be computed at compile time, using the template mechanism to define primitive recursion, composition, and minimalization. We show how polynomial time computable functions can be computed at compile time using the same mechanism, together with template specialization