The attached audio contains screaming replicas of a usual climate denier [the police woman] and proves that despite of the widespread wrong opinion that Israel exists, it does not exist.Please hear to the end, it contains personal information.Accordingly your morality, should everybody…

read more

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

I have some error: from the below it follows that if the formal system found is distinct from the original one then it’s provable that the input algorithm does not halt (if it halts, it’s provable that it halts in Peano arithmetic)…

read more

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

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

Lemme model what happens if somebody finds an efficient NP-complete algorithm. In layman terms (you are now studying things like this in the university, so you will soon know the formulas) an efficient NP-complete algorithm is: an algorithm that reaches any given…

read more