#### Archive for July 22nd, 2005

Fri 22 Jul 2005

## EditCSS

Siete un/una blogger.

Usate Firefox.

Avreste anche voglia di dare un ritocco alla grafica del blog, ma il pensiero di dover venire alle mani con quella metapalla di CSS vi manda KO.

Ci siamo?

Ora immaginate di aprire la vostra homepage, di cliccare con il tasto destro del mouse e di scegliere *EditCSS* dal menu a comparsa.

Sulla sinistra si apre un pannello laterale con tutti i parametri CSS ordinati e carini.

E, soprattutto, appena ne modificate uno gli effetti sulla pagina si riflettono *in tempo reale*.

Cioè, troppo giusto.

Per tutti gli altri, questo post è inutile.

Fri 22 Jul 2005

## Kill Time

Fri 22 Jul 2005

## Durex Advertising Collection

L’intero sito vale una visita.

Fri 22 Jul 2005

## Gödel’s Incompleteness Theorem for dummies

1. Someone introduces Gödel to a UTM, a machine that is supposed to be a Universal Truth Machine, capable of correctly answering any question at all.

2. Gödel asks for the program and the circuit design of the UTM. The program may be complicated, but it can only be finitely long. Call the program P(UTM) for Program of the Universal Truth Machine.

3. Smiling a little, Gödel writes out the following sentence: “The machine constructed on the basis of the program P(UTM) will never say that this sentence is true.” Call this sentence G for Gödel. Note that G is equivalent to: “UTM will never say G is true.”

4. Now Gödel laughs his high laugh and asks UTM whether G is true or not.

5. If UTM says G is true, then “UTM will never say G is true” is false. If “UTM will never say G is true” is false, then G is false (since G = “UTM will never say G is true”). So if UTM says G is true, then G is in fact false, and UTM has made a false statement. So UTM will never say that G is true, since UTM makes only true statements.

6. We have established that UTM will never say G is true. So “UTM will never say G is true” is in fact a true statement. So G is true (since G = “UTM will never say G is true”).

7. “I know a truth that UTM can never utter,” Gödel says. “I know that G is true. UTM is not truly universal.”

(via)

Fri 22 Jul 2005

## Gödel’s Incompleteness Theorem for dummies

1. Someone introduces Gödel to a UTM, a machine that is supposed to be a Universal Truth Machine, capable of correctly answering any question at all.

2. Gödel asks for the program and the circuit design of the UTM. The program may be complicated, but it can only be finitely long. Call the program P(UTM) for Program of the Universal Truth Machine.

3. Smiling a little, Gödel writes out the following sentence: “The machine constructed on the basis of the program P(UTM) will never say that this sentence is true.” Call this sentence G for Gödel. Note that G is equivalent to: “UTM will never say G is true.”

4. Now Gödel laughs his high laugh and asks UTM whether G is true or not.

5. If UTM says G is true, then “UTM will never say G is true” is false. If “UTM will never say G is true” is false, then G is false (since G = “UTM will never say G is true”). So if UTM says G is true, then G is in fact false, and UTM has made a false statement. So UTM will never say that G is true, since UTM makes only true statements.

6. We have established that UTM will never say G is true. So “UTM will never say G is true” is in fact a true statement. So G is true (since G = “UTM will never say G is true”).

7. “I know a truth that UTM can never utter,” Gödel says. “I know that G is true. UTM is not truly universal.”

(via)