Barbosa, Uniform Polynomial Time Bounds, and Promises

Abstract

This note is a commentary on, and critique of, Andre Luiz Barbosa's paper entitled "P != NP Proof." Despite its provocative title, what the paper is seeking to do is not to prove P ≠ NP in the standard sense in which that notation is used in the literature. Rather, Barbosa is (and is aware that he is) arguing that a different meaning should be associated with the notation P ≠ NP, and he claims to prove the truth of the statement P ≠ NP in his quite different sense of that statement. However, we note that (1) the paper fails even on its own terms, as due to a uniformity problem, the paper's proof does not establish, even in its unusual sense of the notation, that P ≠ NP; and (2) what the paper means by the claim P ≠ NP in fact implies that P ≠ NP holds even under the standard meaning that that notation has in the literature (and so it is exceedingly unlikely that Barbosa's proof can be fixed any time soon).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…