Tag: NP-complete algorithm

Uncategorized

Time machines, quantum mechanics, and word of God

By Victor Porton
On

I claim that the basic ideas of Judea-Christian (and apparently Muslim, too) religion of tbe holy book and God acting in the universe has a consistent and beautiful scientific explanation (in the assumption of highly capable reasonable life in cosmos and of…

read more
##################################
Computer science Open problems Philosophy

Improving NP-complete algorithms

By Victor Porton
On

Suppose we have an (efficient) NP-complete algorithm. I remind that proving a provable theorem isn’t an NP problem, because there are theorems whose shortest proof is of super-exponential length. However, finding a proof that is below a given “threshold” length is an…

read more
#######
Computer science

[ERRONEOUS] A proof of P=NP using a Merkle tree – a new version

By Victor Porton
On

I’ve produced a short and much elementary proof of P=NP (without an efficient algorithm presented). I sent it to a reputable CS journal and insofar there were no errors noticed by the editor. Here is an updated version of my proof with…

read more
############
Computer science Open problems

[ERRONEOUS] A proof of P=NP using a Merkle tree

By Victor Porton
On

I denote s(X) the size of data X (in bits). I denote execution time of an algorithm A as t(A,X). Using a Merkle tree technology similar to one of the Cartesi crypto (but with a true random number generator, and possibly the…

read more
############