- Background
- Early 20th century mathematicians (e.g., Bertrand Russell, Alfred Whitehead, David Hilbert, etc.): find the axioms from which all math follows and procedures for proving/deducing it
- Kurt Gödel: that’s impossible
- Consider the statement “this statement has no proof”
- If there is a proof, then the statement is false and so mathematical proof has proven a falsehood, math is inconsistent
- Or there is indeed no proof, so that statement is true, but math is incomplete
- Leaving only the hope of decidability, i.e., that there is some “procedure” for telling which statements are provable and which aren’t
- Turing machines and “On Computable Numbers…”
- 1935 - 36
- Formal definition of “procedure” aka “algorithm”
- Proved that certain decision processes can’t exist
- For example, which coin I will give you in a guessing game
- Computers
- 1945 - 48
- ACE
- Manchester, after ACE project fizzled out
- Artificial intelligence
- ca 1950
- Turing test
- Try ALICE at http://sheepridge.pandorabots.com/pandora/talk?botid=b69b8d517e345aba&skin=custom_iframe as an example
- Pairs try to guess whether other pair they are exchanging electronic messages with is answering for themselves or feeding questions and answers through ALICE
- Team 1
- Do you like the cold?
- I don’t know, I’ve never experienced it.
- What’s ideal weather for you?
- Sure, I can do it for you. What do you want?
- Do what?
- Anything.
- Go Knights!
- Knights riding horses?
- What is your name?
- Alyssa Henderson
- Hi Shenea
- Lol howdy.
- You’re from the south now?
- Team 2
- What is your name?
- A.L.I.C.E.
- What is your favorite sports team?
- I don’t follow sports
- What do you follow?
- I follow my dreams
- What are your dreams?
- I don’t sleep
- You don’t have to sleep to dream, do you?
- I suppose
- Alternatively, find an online version of “eliza”
- Peer reviews of Breaking the Code drafts
- Bring 3 copies to class
- Email me a copy before class