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…

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