{ "items" : [
    { "id" : "http://webisa.webdatacommons.org/247146442"
      "properties" : {
        "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" : [ "- yes, if the tape is an infinite solid-colour tape, and the system is considered universal if the evolution of any Turing machine to any given number of steps can be deduced from the sequence of situations of the system by a process that can be proven in advance to halt (this shows that a system can be universal without input; I have not proven this yet, but based on my programming experience it s" ] ,
        "http://www.w3.org/ns/prov#wasQuotedFrom" : [ "nyu.edu" ] } },

    { "id" : "http://webisa.webdatacommons.org/prov/309108969"
      "properties" : {
        "http://www.w3.org/ns/prov#wasDerivedFrom" : [ "http://webisa.webdatacommons.org/247146442" ] } },

    { "id" : "http://webisa.webdatacommons.org/prov/211244914"
      "properties" : {
        "http://www.w3.org/ns/prov#wasDerivedFrom" : [ "http://webisa.webdatacommons.org/247146442"] } } }
