Compile-time Computation of Polytime Functions

: 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 that polynomial time computable functions can be computed at compile-time using the same mechanism, together with template specialization. Key Words: Static computation, C++ templates, polytime computable functions.

• Type: Journal
• Year: 2007
• Where: JUCS
• Authors: Emanuele Covino, Giovanni Pani, Daniele Scrimieri
• Keywords: Computable Functions, JUCS 2007, Partial Recursive Function, Template Mechanism