| http://www.w3.org/ns/prov#value | - Theproblem: given a computer program and an input to it, determine whether the program will halt onthat input or continue working inde???nitely on it.We can prove by contradicion that this problem is undecidable.Suppose that A is an algorithm that solves the halting problem.
|
