How We Lost Most of Mathematics
In Israel a very important event happened, but it was unnoticed. In 2019 I discovered ordered semigroup actions (and ordered semicategory actions). I am (almost) the first human who put together these three words “ordered semigroup actions” (there is a decades old article with these words, but there they are no properly defined). There were […]
How to Prepare to An Efficient NP-Complete Algorithm
Previously, I published an article claiming that publishing an efficient NP-complete algorithm would kill mankind in a few months. In this article I will consider this scenario and mitigation in more details. I write this, because I recently self-published and submitted to a prestigious math journal my proof of P=NP (by the way, check it for errors). It […]
A new characterization of complete funcoids
I’ve proved today (the proof is surprisingly simple) that a funcoid $latex f$ is complete, if and only if $latex f\circ \bigcup K=\bigcup_{g\in K}(f\circ g)$ for any set $latex K$ of funcoids. Moreover, $latex K$ can be restricted to only principal funcoids without loss of equivalency. See Algebraic Theory of General Topology.
Israel policeman who is a climate denier and facts
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 who ignores this story die or not? [I was a little inexact: the […]
Time machines, quantum mechanics, and word of God
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 possibility of time travel). This explanation also endorses Shumerian legends about annuaks as […]
Improving NP-complete algorithms
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 NP-complete problem. Suppose our NP-complete algorithm is fixed. How to improve it’s ability […]
[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 reputable CS journal and insofar there were no errors noticed by the editor. Here is an updated version of my proof with some errors corrected: p=np-merkle.pdf In more details (and some errors corrected): Yet a […]
[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). Using a Merkle tree technology similar to one of the Cartesi crypto (but with a true random number generator, and possibly the size of hashes themselves growing logarithmically), the size of the data and time […]
Polycarp Wafula Temba, Nairobi, Kenya – selling fake mathematician certificates and more fake legal documents
The lawyer Polycarp Temba from Kenya -tried to sell me a fake “government” mathematician certificate and sold me fake legal services. Our complete correspondence and his documents.
What 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 this in the university, so you will soon know the formulas) an efficient NP-complete algorithm is: an algorithm that reaches any given decision accomplishment if what “to accomplish” is exactly (mathematically) described and is accomplishable […]