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 cc.complexity-theory
Search options not deleted
user 12660
P versus NP and other resource-bounded computation.
6
votes
1
answer
342
views
Bounded computation and incompleteness
Is there a complete theory T over a logical language L such that bounded computation may be encoded in it? Computational questions can be framed as arithmetical ones by interpreting them over natural …
8
votes
3
answers
678
views
Decision problems vs functions
Complexity theory seems to be built around decision problems rather than functions.
Who introduced this first and what is the reason for this choice?
For example, Edmonds' "Paths, trees and flowers …
1
vote
Should we consider $\mathsf{P} \neq \mathsf{NP}$ a law of nature?
The statement P≠NP can encoded as a statement $\phi$ about natural numbers. Since $\phi$ is either true or false about the naturals, the answer to the question is a purely mathematical one. This is de …