Non-surveyable proof
id:
non-surveyable-proof-289-14166507
title:
Non-surveyable proof
text:
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 1979 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. Surve
brand slug:
wiki
category slug:
encyclopedia
description:
Demonstration of a mathematical statement's followability not easily verified by hand
original url:
https://en.wikipedia.org/wiki/Non-surveyable_proof
date created:
date modified:
2024-03-20T11:22:26Z
main entity:
{"identifier":"Q22907339","url":"https://www.wikidata.org/entity/Q22907339"}
image:
fields total:
13
integrity:
14