Saved in:
| Main Author: | |
|---|---|
| Format: | Recurso digital |
| Language: | |
| Published: |
Zenodo
2026
|
| Online Access: | https://doi.org/10.5281/zenodo.19075104 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866901187874258944 |
|---|---|
| author | Turishchev, Alexander |
| author_facet | Turishchev, Alexander |
| contents | <p>The classical P vs NP problem is shown to be incomplete. The question has no single answer without specifying who solves, how much time they have, and why they solve. Introducing R (solver), t (time), and g (goal) reveals that both P = NP and P ≠ NP can be simultaneously true for different contexts. This paper argues for a new, conditional approach to complexity theory.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_19075104 |
| institution | Zenodo |
| language | |
| publishDate | 2026 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | The Observer in P vs NP Turishchev, Alexander <p>The classical P vs NP problem is shown to be incomplete. The question has no single answer without specifying who solves, how much time they have, and why they solve. Introducing R (solver), t (time), and g (goal) reveals that both P = NP and P ≠ NP can be simultaneously true for different contexts. This paper argues for a new, conditional approach to complexity theory.</p> |
| title | The Observer in P vs NP |
| url | https://doi.org/10.5281/zenodo.19075104 |