I hope I'm involved!

IS313 Finale: projects! 2010 Projects! VPool (Jonathan) 2009 Projects: Picobot! (Michael) Go (Charles) Role-based access control (James) Dice (and RegDice!) (James) PyGame – Snake! (Mohammed Alateeq) PyGame - Snake! (Ivan, with SQL!) PyGame – Tarot!! (Karen Sun) PyGame – Collector!!! (Baris A.) PyGame - Snake! (Sucheng, James) PyGame – Pong!!!! (Sarah A.) I hope I'm involved! PyGame - Bomberman Jetters! PyGame – PicoGirl!!!!! (Maria A.) (Congshan, Bill, Spencer) Google event tracker (Joe) SillyLibs! (Amin and Mohammad) TextClouds (HsingHuei) Restaurant rating/Django (Peter) TextClouds (Bridget and Laura) Tic-tac-toe player (Payal) Scholarship survey (Zara, Roni, Joanne) vPool (Igho and Yernur) +map-based writing prompt Kyle (Python + Objective C: Flixy!) Binary object DB (Jeff w/Twitter + OCR) IT placement app (Phil, Tim, Hamdan) Restaurant: business site (M. Alyami & Abdul A.)

What happens in Vegas... ? Perhaps the saying isn't always true... drivers watching out for cars... ... or vice versa! reconstructing ice fields

E-Portfolios !

IS313 Finishing Schedule Monday, Dec. 6Today! In-class project presentations • Tuesday, Dec. 7 Intermediate progress report due with presentation slides Monday, Dec. 13 "Office hours" here @ CGU: a chance to work on/get help with the final proj. 4:00 – 6:30 pm • Friday, Dec. 17 Final projects due (any time)

For tomorrow… What does this mean? (1) Another update of your progress… with your presentation…!

For next Friday… A final .zip of your project... (*) please include screenshots or a video (if I'll never be able to get it running...!)

Feedback…

Feedback… No name! #2 Mark where you would judge the pace of the class material: #1a What are one or more things you would keep about IS313 as it is? #3 How would you judge this class compared to other CGU classes? #1b What are one or more things you would add/change/delete about IS313? #4 How much time did this class take, compared to other CGU classes?

Good luck with the project... ... and beyond! I'll be here next Mon. ...

Limitations of CS! • They involve infinity. Many potentially useful problems are impossible to compute! • They involve self-reference. • Or they can be interpreted as such. Inf checks for infinite loops. in finite time

Unsolvable problems • They involve infinity. Many potentially useful problems are impossible to compute! • They involve self-reference. • Or they can be interpreted as such. A string containing a Python function Any string defInf( fs, inp ): f = make_func(fs) if f(inp)runs forever: returnTrue else: returnFalse Inf checks for infinite loops. in finite time

the iPhone's icon for Google Maps …

make_func? These Python strings look decidedlyfunc-y Strings and functions are one and the same… Python creates Python! What's this doing? Python runs Python! Let's test it! f is the function in fs

A working Inf Inf does exist - and does work - if given infinite time… A string containing a Python function Any string defInf( fs, inp ): f = make_func(fs) if f(inp) or not f(inp): returnFalse else: returnTrue This Inf checks for infinite loops. but can use infinite time! And, to be fair, it never really returns True !

Proof strategy Presume that Inf exists. A string containing a Python function We show that this results in a contradiction… Any string defInf( fs, inp ): f = make_func(fs) if f(inp)runs forever: returnTrue else: returnFalse Thus, the presumption "Inf exists" is false. So, Infcan not exist. Inf: infinite-loop checker.

Presume: Inf( fs, inp ) works… We build a new function, Cant A string containing a Python function defCant( fs ): ifInf(fs,fs): return 42 else: while True: print"ha!" Cant stubbornly reverses the predictive power of Inf ! Cant takes only one input, a string containing a Python function. This name Cant be a coincidence!

Presume: Inf( fs, inp ) works… We build Cant: Consider… A string containing a Python function fs2 =""" def Cant( fs ): if Inf(fs,fs): return 42 else: while True: print "ha!" """ defCant( fs ): ifInf(fs,fs): return 42 else: while True: print"ha!" >>> Cant( fs2 )

Thus… can not exist… Inf( fs, inp ) can not be written… can not be programmed… Infinite-loop checking can not be done by computer. The "Halting problem" is uncomputable. can it be done biologically?

Turing's proof Alonzo Church, too + 36 more pages

IS313 Finale: projects! 2010 Projects! VPool (Jonathan) 2009 Projects: Picobot! (Michael) Go (Charles) Role-based access control (James) Dice (and RegDice!) (James) PyGame – Snake! (Mohammed Alateeq) PyGame - Snake! (Ivan, with SQL!) PyGame – Tarot!! (Karen Sun) PyGame – Collector!!! (Baris A.) PyGame - Snake! (Sucheng, James) PyGame – Pong!!!! (Sarah A.) I hope I'm involved! PyGame - Bomberman Jetters! PyGame – PicoGirl!!!!! (Maria A.) (Congshan, Bill, Spencer) Google event tracker (Joe) SillyLibs! (Amin and Mohammad) TextClouds (HsingHuei) Restaurant rating/Django (Peter) TextClouds (Bridget and Laura) Tic-tac-toe player (Payal) Scholarship survey (Zara, Roni, Joanne) vPool (Igho and Yernur) +map-based writing prompt Kyle (Python + Objective C: Flixy!) Binary object DB (Jeff w/Twitter + OCR) IT placement app (Phil, Tim, Hamdan) Restaurant: business site (M. Alyami & Abdul A.)