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

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	To add yet another example, here is a set for which neither it nor its compliment are recursively enumerable: The set of all Turing machines accepting exactly 3 words.
http://www.w3.org/ns/prov#wasQuotedFrom	stackexchange.com