Proof of P $\neq$ NP

[Mario Carneiro]

This is just a hot take in the form of a pointed question: How does the
proof of theorem 8 break if one replaces the set LA of polynomial time
computable terms by arbitrary computable terms (e.g. lambda calculus, or
perhaps some total computable type theory)? Such a theory should also be
able to represent all the functions mentioned, as well as supporting the
diagonalization argument, but the conclusion would seem to suggest that SAT
is not computable, so presumably some part of the argument breaks down.

Mario Carneiro

On Wed, Sep 8, 2021 at 9:39 PM <martdowd at aol.com> wrote:

> FOM:
>
> I have a proof of P $\neq$ NP.
>     https://www.researchgate.net/publication/354423778
>
> Martin Dowd
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20210908/fa849b64/attachment-0001.html>