Skip to main content
Otakar Molnár López's user avatar
Otakar Molnár López's user avatar
Otakar Molnár López's user avatar
Otakar Molnár López
  • Member for 1 year, 3 months
  • Last seen more than a month ago
About

A software developer with interest in mathemathics, formal systems and undecidability. I like the halting problem and the Gödel incompletness theorems.

I like the fact that you can derive, from the halting problem, a non-constructive meta-proof about the existence of a set of programs that don't halt and also have no non-termination proof. This meta-proof can't be constructive. Therefore, there is a constructive meta-meta-proof about non-constructive proofs that can't be constructive.

I like to conjecture that a program that enumerates ZFC theorems and has the instruction to halt if it finds a P=NP theorem, its negation, or a theorem stating its independence, will never halt. If that is the case, the conjecture could never be proven.

Badges
This user doesn’t have any gold badges yet.
This user doesn’t have any silver badges yet.
7
bronze badges
Top tags
0
Score
1
Posts
100
Posts %
0
Score
1
Posts
100
Posts %
Top posts