Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q22907339> ?p ?o }
Showing triples 1 to 26 of
26
with 100 triples per page.
- Q22907339 subject Q6799333.
- Q22907339 subject Q7452060.
- Q22907339 subject Q8279957.
- Q22907339 abstract "In the philosophy of mathematics, a non-surveyable proof is a mathematical proof that is considered infeasible for a human mathematician to verify and so of controversial validity. The term was coined by Thomas Tymoczko in 1980 in criticism of Kenneth Appel and Wolfgang Haken's computer-assisted proof of the Four-Color Theorem, and has since been applied to other arguments, mainly those with excessive case splitting and/or with portions dispatched by a difficult-to-verify computer program. Surveyability remains an important consideration in computational mathematics.".
- Q22907339 wikiPageWikiLink Q101965.
- Q22907339 wikiPageWikiLink Q1047000.
- Q22907339 wikiPageWikiLink Q1122491.
- Q22907339 wikiPageWikiLink Q1150675.
- Q22907339 wikiPageWikiLink Q11538.
- Q22907339 wikiPageWikiLink Q178161.
- Q22907339 wikiPageWikiLink Q179550.
- Q22907339 wikiPageWikiLink Q180536.
- Q22907339 wikiPageWikiLink Q184410.
- Q22907339 wikiPageWikiLink Q224787.
- Q22907339 wikiPageWikiLink Q3043042.
- Q22907339 wikiPageWikiLink Q3990732.
- Q22907339 wikiPageWikiLink Q4826475.
- Q22907339 wikiPageWikiLink Q65082.
- Q22907339 wikiPageWikiLink Q6799333.
- Q22907339 wikiPageWikiLink Q7452060.
- Q22907339 wikiPageWikiLink Q8279957.
- Q22907339 wikiPageWikiLink Q842755.
- Q22907339 wikiPageWikiLink Q9299950.
- Q22907339 wikiPageWikiLink Q966873.
- Q22907339 comment "In the philosophy of mathematics, a non-surveyable proof is a mathematical proof that is considered infeasible for a human mathematician to verify and so of controversial validity. The term was coined by Thomas Tymoczko in 1980 in criticism of Kenneth Appel and Wolfgang Haken's computer-assisted proof of the Four-Color Theorem, and has since been applied to other arguments, mainly those with excessive case splitting and/or with portions dispatched by a difficult-to-verify computer program.".
- Q22907339 label "Non-surveyable proof".