Suppose we have an (efficient) NP-complete algorithm. I remind that proving a provable theorem isn’t an NP problem, because there
Continue readingCategory: Computer science
Halting problem is essentially solvable
I have some error: from the below it follows that if the formal system found is distinct from the original
Continue readingCircumventing First Godel Incompleteness Theorem
A statement equivalent to First Incompleteness theorem There are theorems that can be neither proved nor disproved in a given
Continue reading[ERRONEOUS] A proof of P=NP using a Merkle tree – a new version
I’ve produced a short and much elementary proof of P=NP (without an efficient algorithm presented). I sent it to a
Continue reading[ERRONEOUS] A proof of P=NP using a Merkle tree
I denote s(X) the size of data X (in bits). I denote execution time of an algorithm A as t(A,X).
Continue readingWhat if somebody discovers and publish an efficient P=NP solution
Lemme model what happens if somebody finds an efficient NP-complete algorithm. In layman terms (you are now studying things like
Continue readingI’ve Proved Constructivity of P=NP
I’ve found (and proved) an algorithm that is NP-complete in the assumption that P=NP. In other words, if P=NP has
Continue reading