@MSGID:
<007e1ed2-0f57-447d-bb5d-8571c7e576dfn@googlegroups.com> 1cdf28d7
@REPLYADDR Victor Porton
<porton.victor@gmail.com>
@REPLYTO 2:5075/128 Victor Porton
@CHRS: CP866 2
@RFC: 1 0
@RFC-Message-ID:
<007e1ed2-0f57-447d-bb5d-8571c7e576dfn@googlegroups.com>
@TZUTC: -0700
@PID: G2/1.0
@TID: FIDOGATE-5.12-ge4e8b94
 Check for errors my proof of P=NP (without a practically efficient
algorithm for an NP-complete problem):
https://drive.google.com/file/d/16Ws_eZF8f-rn1mFvkIT-UdMdvTwOu4vO/view?usp=drive
_link
 The proof is based on logic, namely Easton`s theorem (and its
consequence, incompleteness of ZFC), passing algorithms as arguments of algorithms,
inverting bijections, reduction of SAT to another NP problem.
--- G2/1.0
 * Origin: usenet.network (2:5075/128)
SEEN-BY: 5001/100 5005/49 5015/255 5019/40 5020/715
848 1042 4441 12000
SEEN-BY: 5030/49 1081 5058/104 5075/128
@PATH: 5075/128 5020/1042 4441