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 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

I’ve found (and proved) an algorithm that is NP-complete in the assumption that P=NP. In other words, if P=NP has a positive solution, my algorithm is its solution. I was kinda afraid if I already have almost solved P=NP as an easy…

read more

I remind that I defined generalized limit of arbitrary function. The limit may be an infinitely big value. It allows to define derivative and integral of an arbitrary function. I also defined what are solutions of partial differential equations where such infinities…

read more

Continuing my research from general topology monograph Algebraic General Topology, the following new open problems arose: I remind that I define generalized limit of arbitrary function. This limit is defined in terms of funcoids. As I show in the Book 3, Algebra,…

read more

I am attempting to find the value of the node “other” in a diagram currently located at this file, chapter “Extending Galois connections between funcoids and reloids”. By definition $latex \mathrm{other} = \Phi_{\ast}(\mathsf{RLD})_{\mathrm{out}}$. A few minutes ago I’ve proved $latex (\Phi_{\ast}(\mathsf{RLD})_{\mathrm{out}})\bot = \Omega^{\mathsf{FCD}}$, that…

read more