Loading...
Limit, logic, and computation
We introduce “ultrafilter limits” into the classical Turing model of computation and develop a paradigm for interpreting the problem of distinguishing the class P from NP as a logical problem of decidability. We use P(NP) to denote decision problems which can be solved on a (nondeterministic) Turing...
Saved in:
| Main Author: | |
|---|---|
| Format: | Artigo |
| Language: | Inglês |
| Published: |
The National Academy of Sciences
1998
|
| Subjects: | |
| Online Access: | https://ncbi.nlm.nih.gov/pmc/articles/PMC18137/ https://ncbi.nlm.nih.gov/pubmed/9419334 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|