Posts Tagged ‘Gödel’s incompleteness theorems’

Incomplete AND Inconsistent

April 12, 2012 Leave a comment

In the early 1900s, Bertrand Russell and Alfred Whitehead published their seminal work, “Principia Mathematica“. Its purpose was to “derive all of mathematics from purely logical axioms” and many smart minds thought they pulled off this Herculean task. However,  Kurt Godel came along and busted up the party by throwing a turd in the punch bowl with his blockbuster incompleteness theorem. The incompleteness theorem essentially states that no system of logic can be both consistent and complete. One or the other, but not both.

So, let’s apply Godel’s findings to “logical“, software-intensive systems:

Next, let’s apply the incompleteness theorem to “logical” management systems:

Me thinks that Mr. Spock, one of my all time heroes because of his calm, cool, and collected demeanor and logical genius, was wrong – at least some of the time. Damn that Kurt Godel!

%d bloggers like this: