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 moreI 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 moreA statement equivalent to First Incompleteness theorem There are theorems that can be neither proved nor disproved in a given formal system (containing arithmetic). This theorem makes people sad: There are “problems” that cannot be solved. But God teaches me that there…

read moreLemme 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 moreDescribes the new political (economical) ideology under the contingent name social crypto libertarianism or left crypto libertarianism (Note that it is not social, not left, and not libertarianism, I call it so for lack of more suitable words.) and the practical steps of how to implant this concept into modern economy. You are offered to participate in the experiment volunteering or for a reward.

read moreIn the past I thought so: Common money-earning programmers just have the skill to comprehend with their egg-heads how program flow moves between multiple levels of functions and classes calling each other in a “perverted”, unpredictable, messy fashion. While I am a…

read more