I my book discontinuous analysis I forgot about Newton-Leibniz theorem, despite of claiming generalizing an entire Analysis I course for a discontinuous case. The answer is simple: Newton-Leibniz theorem in discontinuous analysis is simply Newton-Leibniz theorem on the space SUPER(X), where X…

read morePhDs, professors, everybody “cries” that peer review doesn’t work well. Professors, you are idiots! There is an easy way to fix peer review, and for this you need only think “We can.”: Found a math article on the Web? Review it and…

read moreIn 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…

read morePreviously, 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…

read moreI’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…

read moreThe 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 moreI 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 moreSuppose 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 moreI’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 moreI 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