A Critique of "Solving the P/NP Problem Under Intrinsic Uncertainty", arXiv:0811.0463

TL;DR

This paper critically examines Jaeger's 2008 attempt to solve the P versus NP problem under uncertainty, highlighting logical flaws, unsupported assumptions, and missing rigorous proofs that undermine its validity.

Contribution

It provides a detailed critique identifying logical oversights, unsupported assumptions, and gaps in proof in Jaeger's approach to the P versus NP problem.

Findings

Identifies logical oversights in Jaeger's model

Highlights unsupported assumptions in the paper

Notes missing rigorous proofs weaken the argument

Abstract

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.