3 ms·

> What Rust Can Do That Other Languages Can't But other languages are Turing-complete too...

• Wyverald 10y ago
  I'm sure you understand that not all language features fall under Turing-completeness.
• deleted 10y ago
  [deleted]
• amelius 10y ago
  Yes, but Rust might still be able to do what other languages can't. For example, to express a given program using at most N input symbols.
  • wtallis 10y ago
    Perhaps more relevantly, we can talk about the relative sizes of the sets of invalid Rust programs that rustc will fail to reject, and invalid C programs that gcc will fail to reject. The halting problem tells us that neither set is empty, but there's still a lot of room for differentiation. (Actually, upon further thought, it may be that rustc rejects all invalid Rust programs and some valid ones. gcc certainly accepts some invalid C programs.)
    • tatterdemalion 10y ago
      My rough approximation is that the difference between a sound type system and an unsound type system is that a sound system rejects some valid programs and unsound system accepts some invalid ones.
• adrianN 10y ago
  Brainfuck is Turing complete too, but it's not Tetris complete. Turing completeness is a statement about computing functions on the natural numbers. It's not terribly useful when applied to real programming languages.