About: http://webisa.webdatacommons.org/86437530

Property	Value
http://www.w3.org/1999/02/22-rdf-syntax-ns#type	http://www.w3.org/ns/prov#Entity
http://www.w3.org/ns/prov#value	That is, an input to the problem is a pair , where is a Turing machine and is a possible input for , and the goal of the problem is to determine whether , on input , halts and rejects in at most steps, where is the length of .
http://www.w3.org/ns/prov#wasQuotedFrom	wordpress.com