I think he means that, through templates, the C++ *type system* is Turing-comple... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

eli_gottlieb on May 12, 2015 | parent | context | favorite | on: Abstraction without overhead: traits in Rust

I think he means that, through templates, the C++ type system is Turing-complete.

steveklabnik on May 12, 2015 [–]

Rust's is too.

kibwen on May 12, 2015 | [–]

Though the skimpy recursion limit makes it fairly impossible to do anything interesting with this property, much to the chagrin of some people. :P

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact