A software developer with interest in mathemathics, formal systems and undecidability. I like the halting problem and the Gödel incompletness theorems. Specifically, I like the fact that there is a non-constructive proof of the existence of an infinite set of programs that don`t halt and also have no non-termination proof, that can`t be known by example. I like to conjecture that a program that enumerates ZFC theorems and has the instruction to halt if it finds a P=NP theorem or its negation is one of these programs. ©