EntBlog
Code, 3D, Games, Linux and much more...

C++ Templates are Turing Complete

Reading one of the latest books of Scott Meyers I discovered that C++ templates have been proved to be Turing Complete. Turing Complete means that C++ templates can emulate a Turing Machine, so they can execute any algorithm (of course, in a theory world because for example Turing Machines have unlimited storage capacity). This means that you can metaprogam with templates anything you can code in C++. Obviously this doesn’t say anything about how to implement it or how easy it would be. In theory you could, for example, run a OS like Windows using a C++ compiler as a MetaOS.

I always found C++ Metaprogramming a little bit hacky. If you are interested, this is a paper demonstrating the Turing-completeness of C++ templates.