Re:Proving that C++'s grammar is undecidable
by Kranar on Wednesday April 29, 2020 @11:27AM
(#23020373)
If that metaprogramming is Turing complete then yes. The point of this article is to show that metaprogramming in C++ is Turing complete. It had already been widely known but this article presents an explicit demonstration of it.
[ Parent
| on HN ]