Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1962320> ?p ?o }
Showing triples 1 to 54 of
54
with 100 triples per page.
- Q1962320 subject Q7035970.
- Q1962320 subject Q8087979.
- Q1962320 subject Q8596994.
- Q1962320 abstract "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. There are uncountably many undecidable problems, so the list below is necessarily incomplete. Though undecidable languages are not recursive languages, they may be subsets of Turing recognizable languages i.e. such undecidable languages may be recursively enumerable.Many, if not most, undecidable problems in mathematics can be posed as word problems: determining when two distinct strings of symbols (encoding some mathematical concept or object) represent the same object or not.For undecidability in axiomatic mathematics, see list of statements undecidable in ZFC.".
- Q1962320 wikiPageExternalLink what-are-the-most-attractive-turing-undecidable-problems-in-mathematics.
- Q1962320 wikiPageWikiLink Q11030584.
- Q1962320 wikiPageWikiLink Q1128796.
- Q1962320 wikiPageWikiLink Q1151809.
- Q1962320 wikiPageWikiLink Q1382512.
- Q1962320 wikiPageWikiLink Q1427965.
- Q1962320 wikiPageWikiLink Q1456811.
- Q1962320 wikiPageWikiLink Q163310.
- Q1962320 wikiPageWikiLink Q177646.
- Q1962320 wikiPageWikiLink Q1893717.
- Q1962320 wikiPageWikiLink Q192161.
- Q1962320 wikiPageWikiLink Q202906.
- Q1962320 wikiPageWikiLink Q203920.
- Q1962320 wikiPageWikiLink Q207348.
- Q1962320 wikiPageWikiLink Q242028.
- Q1962320 wikiPageWikiLink Q3262192.
- Q1962320 wikiPageWikiLink Q3267583.
- Q1962320 wikiPageWikiLink Q3298493.
- Q1962320 wikiPageWikiLink Q338028.
- Q1962320 wikiPageWikiLink Q338047.
- Q1962320 wikiPageWikiLink Q3406273.
- Q1962320 wikiPageWikiLink Q3435924.
- Q1962320 wikiPageWikiLink Q3502995.
- Q1962320 wikiPageWikiLink Q3526736.
- Q1962320 wikiPageWikiLink Q42989.
- Q1962320 wikiPageWikiLink Q430001.
- Q1962320 wikiPageWikiLink Q44337.
- Q1962320 wikiPageWikiLink Q474147.
- Q1962320 wikiPageWikiLink Q5161137.
- Q1962320 wikiPageWikiLink Q5611242.
- Q1962320 wikiPageWikiLink Q586459.
- Q1962320 wikiPageWikiLink Q622849.
- Q1962320 wikiPageWikiLink Q662830.
- Q1962320 wikiPageWikiLink Q6641390.
- Q1962320 wikiPageWikiLink Q6914396.
- Q1962320 wikiPageWikiLink Q7035970.
- Q1962320 wikiPageWikiLink Q7251.
- Q1962320 wikiPageWikiLink Q787114.
- Q1962320 wikiPageWikiLink Q798572.
- Q1962320 wikiPageWikiLink Q8034369.
- Q1962320 wikiPageWikiLink Q8078.
- Q1962320 wikiPageWikiLink Q8087979.
- Q1962320 wikiPageWikiLink Q818930.
- Q1962320 wikiPageWikiLink Q8596994.
- Q1962320 wikiPageWikiLink Q865760.
- Q1962320 wikiPageWikiLink Q877945.
- Q1962320 wikiPageWikiLink Q986147.
- Q1962320 wikiPageWikiLink Q994399.
- Q1962320 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.".
- Q1962320 label "List of undecidable problems".