1 + 1 = 2
Think it is easy to prove ?
Learn more about Godel's incompleteness theorems and the Halting problem for Turing machines. Check out also "P vs. NP". All these with good introductory materials on Wikipedia.
Then, we can rediscuss the amount of trust one can put in formal systems, including logics (classical, intuitionistic, modal, etc) and axiomatics (with or without AC, the axiom of choice, or the law of excluded middle, etc).
"The village's barber (a man) shaves all the men of the village who don't shave themselves. Who shaves the barber ?"
"Cyril" pronounced "see real". I code stuff.
"To study and not think is a waste. To think and not study is dangerous." -- Confucius
Want DP delivered to your inbox daily? Subscribe here: