# Incompleteness Theorem

### From Uncyclopedia, the content-free encyclopedia

Gödel's famous **Incompleteness Theorem** states that no Talk page is ever complete. He proved it by the *diagonalization method*, forming a diagonal string of comments of "we should end this discussion now" entries.

This result was later improved on by repeatedly adding of "Shut up".

Example of the *diagonalization method*:

Shut up --UserA Shut up --UserB Shut up --UserA Shut up --UserB Shut up --UserA Shut up --UserB Shut up --UserA Shut up --UserB etc.

In Europe, a similar law holds for "Thank you"s:

Thank you --UserA Thank you --UserB Thank you --UserA Thank you --UserB Thank you --UserA Thank you --UserB Thank you --UserA Thank you --UserB etc.

One variant of the Incompleteness Theorem states, that no puzzle is ever complete, there is always one piece of the puzzle that is missing. Again, to determine the missing piece, one can use the diagonal method: when one simply starts with one piece which is at an edge or in the corner, and moves diagonally across the puzzle, one will certainly find that a piece is missing.

Yet another variant of the Incompleteness Theorem states, that no computer program is ever complete. One can find places where code is missing, by moving diagonally through the code, starting at the first or last word of all subroutines / functions / procedures / whatever you want to call it.

To be confused with Godel's Incompleteness Theorem, whose author was too lazy to use umlauts.