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.
Static Computation of Polynomial-time Functions in C++,
COVINO, Emanuele;
2007-01-01
Abstract
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
