How is “this system doesn’t deadlock” not the same as the halting problem?
Proving that a particular program terminates does not require deciding the halting problem on arbitrary programs (same for deadlock freedom)
Proving that a particular program terminates does not require deciding the halting problem on arbitrary programs (same for deadlock freedom)