Critique of Barbosa's "P != NP Proof"
Computational Complexity
2017-11-21 v1
Abstract
We review Andr\'e Luiz Barbosa's paper "P != NP Proof," in which the classes P and NP are generalized and claimed to be proven separate. We highlight inherent ambiguities in Barbosa's definitions, and show that attempts to resolve this ambiguity lead to flaws in the proof of his main result.
Cite
@article{arxiv.1711.07132,
title = {Critique of Barbosa's "P != NP Proof"},
author = {Jackson Abascal and Shir Maimon},
journal= {arXiv preprint arXiv:1711.07132},
year = {2017}
}