Deadlock is literally a halting problem. We can't know for every possible progra...

		pvillano 3 months ago \| parent \| context \| favorite \| on: “Erdos problem #728 was solved more or less autono... 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