A Critique of "Solving the P/NP Problem Under Intrinsic Uncertainty", arXiv:0811.0463
| dc.creator | Richardson, Andrew Keenan | |
| dc.creator | Brown, Cole Arthur | |
| dc.date | 2009-04-24 | |
| dc.date.accessioned | 2026-07-07T13:08:31Z | |
| dc.date.available | 2026-07-07T13:08:31Z | |
| dc.description | Although whether P equals NP is an important, open problem in computer science, and although Jaeger's 2008 paper, "Solving the P/NP Problem Under Intrinsic Uncertainty" (arXiv:0811.0463) presents an attempt at tackling the problem by discussing the possibility that all computation is uncertain to some degree, there are a number of logical oversights present in that paper which preclude it from serious consideration toward having resolved P-versus-NP. There are several differences between the model of computation presented in Jaeger's paper and the standard model, as well as several bold assumptions that are not well supported in Jaeger's paper or in the literature. In addition, we find several omissions of rigorous proof that ultimately weaken this paper to a point where it cannot be considered a candidate solution to the P-versus-NP problem. | |
| dc.description | 7 pages | |
| dc.identifier | https://arxiv.org/abs/0904.3927 | |
| dc.identifier | http://arxiv.org/abs/0904.3927 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/228440 | |
| dc.subject | Computational Complexity | |
| dc.title | A Critique of "Solving the P/NP Problem Under Intrinsic Uncertainty", arXiv:0811.0463 | |
| dc.type | text |