Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with proof-complexity
Search options answers only
not deleted
user 4720
Proof complexity is the field aiming to understand and analyse the computational resources that are required to prove or refute statements.
12
votes
Proof system with same complexity as "informal mathematics"?
In principle, this doesn't have to be true, but I believe it is true in practice for all the formal proof systems that have been implemented. In particular, the length ratio is bounded. The ratio of …
- 16.8k