Rust’s type system is Turing complete: FizzBuzz with Rust Traits A Forth implementation with Rust Traits It is impossible to determine if a program written in a generally Turing complete system will ever stop. That is, it is impossible to write a program f that determines if a program g, where g is written in a Turing complete programming language, will ever halt. The Halting Problem is in fact, an undecidable problem. How is any of this relevant? Rust performs compile-time type inference. ...
