| http://www.w3.org/ns/prov#value | - ???In computability theory, the halting problem is a decision problem which can be stated as follows: given a description of a program and a finite input, decide whether the program finishes running or will run forever, given that input.??? (from Wikipedia)
|
