Search the site

Thursday, April 30, 2015

Kurt Gödel's Incompleteness Theorems meanings

Who was Kurt Godel
"Gödel showed that within a rigidly logical system such as Russell and Whitehead had developed for arithmetic, propositions can be formulated that are undecidable or undemonstrable within the axioms of the system. That is, within the system, there exist certain clear-cut statements that can neither be proved or disproved. Hence one cannot, using the usual methods, be certain that the axioms of arithmetic will not lead to contradictions … It appears to foredoom hope of mathematical certitude through use of the obvious methods. Perhaps doomed also, as a result, is the ideal of science - to devise a set of axioms from which all phenomena of the external world can be deduced."
See numerous explanations @ Miskatonic University Press

Gödel’s Incompleteness Theorem says:

“Anything you can draw a circle around cannot explain itself without referring to something outside the circle – something you have to assume but cannot prove.”

Stated in Formal Language:

Gödel’s theorem says: “Any effectively generated theory capable of expressing elementary arithmetic cannot be both consistent and complete. In particular, for any consistent, effectively generated formal theory that proves certain basic arithmetic truths, there is an arithmetical statement that is true, but not provable in the theory.”

The Church-Turing thesis says that a physical system can express elementary arithmetic just as a human can, and that the arithmetic of a Turing Machine (computer) is not provable within the system and is likewise subject to incompleteness.

Any physical system subjected to measurement is capable of expressing elementary arithmetic. (In other words, children can do math by counting their fingers, water flowing into a bucket does integration, and physical systems always give the right answer.)

Therefore the universe is capable of expressing elementary arithmetic and like both mathematics itself and a Turing machine, is incomplete.


1. All non-trivial computational systems are incomplete

2. The universe is a non-trivial computational system

3. Therefore the universe is incomplete

You can draw a circle around all of the concepts in your high school geometry book. But they’re all built on Euclid’s 5 postulates which are clearly true but cannot be proven. Those 5 postulates are outside the book, outside the circle.

You can draw a circle around a bicycle but the existence of that bicycle relies on a factory that is outside that circle. The bicycle cannot explain itself.

Gödel proved that there are ALWAYS more things that are true than you can prove. Any system of logic or numbers that mathematicians ever came up with will always rest on at least a few unprovable assumptions."

See entire explanation @ Perry Marshall (dot) com

More Info..

  1. Godel's Incompleteness Theorem By Dale Myers @ Hawaii EDU
  2. @ Scientific American
  3. @Wikipedia
  4. Wolfram MathWorld
  5. @ Stanford Encyclopedia of Philosophy