How to beat Godel’s incompleteness theorem: Use ternary logic systems.

Consider this: the incompleteness theorem requires CERTAINTY.

Eliminate the need for certainty by utilizing a logic system that includes uncertainty and you just beat the incompleteness theorem by removing one of its required legs to stand on.

This of course is little comfort to mathematics but it allows for great strides in engineering potential.

Of course I could be wrong about this. This is just the conclusion I’m sitting with for now. Subject to correction smile emoticon

Leave a comment

Your email address will not be published. Required fields are marked *


− one = 3

Leave a Reply