<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/abstract>	"Probl\u00E9m zastaven\u00ED (halting problem) je \u00FAloha teorie vy\u010D\u00EDslitelnosti, kter\u00E1 m\u016F\u017Ee b\u00FDt neform\u00E1ln\u011B zad\u00E1na takto: Zn\u00E1te-li zdrojov\u00FD k\u00F3d programu a jeho vstup, rozhodn\u011Bte, zda program zastav\u00ED, nebo zda pob\u011B\u017E\u00ED nav\u017Edy bez zastaven\u00ED.V roce 1936 Alan Turing dok\u00E1zal, \u017Ee obecn\u00FD algoritmus, kter\u00FD by \u0159e\u0161il probl\u00E9m zastaven\u00ED pro v\u0161echny vstupy v\u0161ech program\u016F, neexistuje. Probl\u00E9m zastaven\u00ED se proto ozna\u010Duje jako algoritmicky nerozhodnuteln\u00FD probl\u00E9m."@cs .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Peanova_aritmetika> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Bijekce> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://cs.dbpedia.org/property/wikiPageUsesTemplate>	<http://cs.dbpedia.org/resource/\u0160ablona:Autoritn\u00ED_data> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Nespo\u010Detn\u00E1> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Alan_Turing> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/D\u016Fkaz_sporem> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Root.cz> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://www.w3.org/2000/01/rdf-schema#label>	"Probl\u00E9m zastaven\u00ED"@cs .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://www.w3.org/ns/prov#wasDerivedFrom>	<http://cs.wikipedia.org/wiki/Probl\u00E9m_zastaven\u00ED?oldid=15392690> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLinkText>	"Probl\u00E9m zastaven\u00ED"@cs .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Algoritmus> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageID>	"23283"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/G\u00F6delovy_v\u011Bty_o_ne\u00FAplnosti> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Cantorova_v\u011Bta> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLinkText>	"probl\u00E9mu zastaven\u00ED"@cs .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://purl.org/dc/terms/subject>	<http://cs.dbpedia.org/resource/Kategorie:Logika> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Po\u010D\u00EDta\u010Dov\u00FD_program> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageLength>	"3055"^^<http://www.w3.org/2001/XMLSchema#nonNegativeInteger> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageOutDegree>	"17"^^<http://www.w3.org/2001/XMLSchema#nonNegativeInteger> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Teorie_vy\u010D\u00EDslitelnosti> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/1936> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLinkText>	"probl\u00E9mem zastaven\u00ED"@cs .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://xmlns.com/foaf/0.1/isPrimaryTopicOf>	<http://cs.wikipedia.org/wiki/Probl\u00E9m_zastaven\u00ED> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLinkText>	"probl\u00E9m zastaven\u00ED"@cs .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Predik\u00E1tov\u00E1_logika> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Kategorie:Vy\u010D\u00EDslitelnost> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageRevisionID>	"15392690"^^<http://www.w3.org/2001/XMLSchema#integer> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageExternalLink>	<http://www.root.cz/clanky/co-je-to-nenaprogramovatelne/> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Nerozhodnuteln\u00FD_probl\u00E9m> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Bezespornost> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://dbpedia.org/ontology/wikiPageWikiLink>	<http://cs.dbpedia.org/resource/Kategorie:Logika> .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://www.w3.org/2000/01/rdf-schema#comment>	"Probl\u00E9m zastaven\u00ED (halting problem) je \u00FAloha teorie vy\u010D\u00EDslitelnosti, kter\u00E1 m\u016F\u017Ee b\u00FDt neform\u00E1ln\u011B zad\u00E1na takto: Zn\u00E1te-li zdrojov\u00FD k\u00F3d programu a jeho vstup, rozhodn\u011Bte, zda program zastav\u00ED, nebo zda pob\u011B\u017E\u00ED nav\u017Edy bez zastaven\u00ED.V roce 1936 Alan Turing dok\u00E1zal, \u017Ee obecn\u00FD algoritmus, kter\u00FD by \u0159e\u0161il probl\u00E9m zastaven\u00ED pro v\u0161echny vstupy v\u0161ech program\u016F, neexistuje. Probl\u00E9m zastaven\u00ED se proto ozna\u010Duje jako algoritmicky nerozhodnuteln\u00FD probl\u00E9m."@cs .
<http://cs.dbpedia.org/resource/Probl\u00E9m_zastaven\u00ED>	<http://purl.org/dc/terms/subject>	<http://cs.dbpedia.org/resource/Kategorie:Vy\u010D\u00EDslitelnost> .