Abstract

– If you give me an algorithm to solve Π, I can check whether this algorithm really solves Π. – But, if you ask me to find an algorithm to solve Π, I may go on forever trying but without success. • But, this result was already found by Aristotle: Assume a proposition Φ. – If you give me a proof of Φ, I can check whether this proof really proves Φ. – But, if you ask me to find a proof of Φ, I may go on forever trying but without success. • In fact, programs are proofs and much of computer science in the early part of the 20th century was built by mathematicians and logicians. • There were also important inventions in computer science made by physicists (e.g., von Neumann) and others, but we ignore these in this talk. ISR 2009, Brasiliá, Brasil 1An example of a computable function/solvable problem • E.g., 1.5 chicken lay down 1.5 eggs in 1.5 days. • How many eggs does 1 chicken lay in 1 day? • 1.5 chicken lay 1.5 eggs in 1.5 days. • Hence, 1 chicken lay 1 egg in 1.5 days. • Hence, 1 chicken lay 2/3 egg in 1 day. ISR 2009, Brasiliá, Brasil 2Unsolvability of the Barber problem • which man barber in the village shaves all and only those men who do not shave themselves? • If John was the barber then – John shaves Bill ⇐ ⇒ Bill does not shave Bill – John shaves x ⇐ ⇒ x does not shave x – John shaves John ⇐ ⇒ John does not shave John • Contradiction. ISR 2009, Brasiliá, Brasil 3Unsolvability of the Russell set problem

Citations