3 ms·

How is “this system doesn’t deadlock” not the same as the halting problem?

• xjm 10mo ago
  Proving that a particular program terminates does not require deciding the halting problem on arbitrary programs (same for deadlock freedom)
• pvillano 10mo ago
  Deadlock is literally a halting problem. We can't know for every possible program if it halts or not, but the complexity of programs we can determine is increasing as tools and techniques get better