{ "items" : [
    { "id" : "http://dbpedia.org/resource/List_of_undecidable_problems"
      "properties" : {
        "http://www.w3.org/2000/01/rdf-schema#comment" : [ "In computability theory, an undecidable problem is a type of computational problem that requires a yes/no answer, but where there cannot possibly be any computer program that always gives the correct answer; that is any possible program would sometimes give the wrong answer or run forever without giving any answer. More formally, an undecidable problem is a problem whose language is not a recursive set; see decidability."] } } }
