I hope I'm involved! Dice (and RegDice!) (James) PyGame – Snake! (Mohammed Alateeq) PyGame – Tarot!! (Karen Sun) PyGame – Collector!!! (Baris A.) PyGame.

Slides:



Advertisements
Similar presentations
What computers just cannot do. (Part II) COS 116, Spring 2012 Adam Finkelstein.
Advertisements

David Evans CS150: Computer Science University of Virginia Computer Science Lecture 26: Proving Uncomputability Visualization.
Lecture 19. Reduction: More Undecidable problems
CS 461 – Nov. 9 Chomsky hierarchy of language classes –Review –Let’s find a language outside the TM world! –Hints: languages and TM are countable, but.
Data Structures and Functional Programming Computability Ramin Zabih Cornell University Fall 2012.
Class 39: Universality cs1120 Fall 2009 David Evans University of Virginia.
IS313 Today: projects! AI? UI? Project plans I hope I'm involved! Role-based access control (James) PyGame - Snake! (Ivan, with SQL!) PyGame - Snake! (Sucheng,
04/23/13 Countability Discrete Structures (CS 173) Derek Hoiem, University of Illinois 1.
Recursion in Python. Recursion Problems in every area of life can be defined recursively, that is, they can be described in terms of themselves. An English.
Prof. Busch - LSU1 Decidable Languages. Prof. Busch - LSU2 Recall that: A language is Turing-Acceptable if there is a Turing machine that accepts Also.
Fall 2003Costas Busch - RPI1 Decidability. Fall 2003Costas Busch - RPI2 Recall: A language is decidable (recursive), if there is a Turing machine (decider)
CSE115/ENGR160 Discrete Mathematics 03/03/11 Ming-Hsuan Yang UC Merced 1.
Fall 2004COMP 3351 The Chomsky Hierarchy. Fall 2004COMP 3352 Non-recursively enumerable Recursively-enumerable Recursive Context-sensitive Context-free.
Welcome to the CIS Seminar Laziness is good for you!
Today - Limits of computation - Complexity analysis examples.
What computers just cannot do. (Part II) COS 116: 3/5/2008 Sanjeev Arora.
1 CSE 417: Algorithms and Computational Complexity Winter 2001 Lecture 18 Instructor: Paul Beame.
Fall 2006Costas Busch - RPI1 Undecidable Problems (unsolvable problems)
Prof. Busch - LSU1 Undecidable Problems (unsolvable problems)
Halting Problem. Background - Halting Problem Common error: Program goes into an infinite loop. Wouldn’t it be nice to have a tool that would warn us.
04/25/13 Halting Problem Discrete Structures (CS 173) Derek Hoiem, University of Illinois 1
Programming for Interactivity Professor Bill Tomlinson Tuesday & Wednesday 6:00-7:50pm Fall 2005.
Cs3102: Theory of Computation Class 18: Proving Undecidability Spring 2010 University of Virginia David Evans.
Announcements Homework – HW8 due Tues 5/29 11am – HW5 grades are out Monday is Memorial Day; no office hours, etc. – Go see a parade, or some fireworks,
Class 37: Uncomputability David Evans University of Virginia cs1120 Halting Problems Hockey Team.
CSE 311 Foundations of Computing I Lecture 30 Computability: Other Undecidable Problems Autumn 2012 CSE 3111.
Section 3.1: Proof Strategy Now that we have a fair amount of experience with proofs, we will start to prove more difficult theorems. Our experience so.
The Halting Problem – Undecidable Languages Lecture 31 Section 4.2 Wed, Oct 31, 2007.
Undecidable Languages (Chapter 4.2) Héctor Muñoz-Avila.
Great Theoretical Ideas in Computer Science about AWESOME Some Generating Functions Probability Infinity Computability With Alan! (not Turing) Mind-
Halting Problem Introduction to Computing Science and Programming I.
CSE 311 Foundations of Computing I Lecture 26 Computability: Turing machines, Undecidability of the Halting Problem Spring
CSE 311 Foundations of Computing I Lecture 29 Computability: Turing machines, Undecidability of the Halting Problem Autumn 2012 CSE 3111.
Great Theoretical Ideas in Computer Science.
1 Computability CS 101E Spring 2007 Michele Co. 2 So Far In Class We’ve seen the following programming constructs –if, if-else, if-else-if –switch –for.
Great Theoretical Ideas in Computer Science.
What computers just cannot do. (Part II) COS 116: 3/1/2011 Sanjeev Arora.
Halting Problem and TSP Wednesday, Week 8. Background - Halting Problem Common error: Program goes into an infinite loop. Wouldn’t it be nice to have.
1 Turing’s Thesis. 2 Turing’s thesis: Any computation carried out by mechanical means can be performed by a Turing Machine (1930)
More Python!. Lists, Variables with more than one value Variables can point to more than one value at a time. The simplest way to do this is with a List.
Russell’s Paradox and the Halting Problem Lecture 24 Section 5.4 Wed, Feb 23, 2005.
SNU OOPSLA Lab. 1 Great Ideas of CS with Java Part 1 WWW & Computer programming in the language Java Ch 1: The World Wide Web Ch 2: Watch out: Here comes.
CS 461 – Nov. 7 Decidability concepts –Countable = can number the elements  –Uncountable = numbering scheme impossible  –A TM undecidable –Language classes.
Powerpoint Templates Page 1 Powerpoint Templates Impossible Math Problems (or should we say, undecidable) Math Club 4/16/2012.
CSE 311 Foundations of Computing I Lecture 28 Computability: Other Undecidable Problems Autumn 2011 CSE 3111.
CompSci On the Limits of Computing  Reasons for Failure 1. Runs too long o Real time requirements o Predicting yesterday's weather 2. Non-computable.
Winter 2016CISC101 - Prof. McLeod1 CISC101 Elements of Computing Science I Course Web Site: The lecture outlines.
Very Hard Problems I am so not kidding about this. Please grab a handout.
Logical Operators.  Quiz  Let's look at the schedule  Logical Operators 2.
PYTHON PROGRAMMING Week 3 - Tuesday. STARTER Hour of Code Video.
Week 3 - Friday.  What did we talk about last time?  Preprocessor directives  Other C features  sizeof, const  ASCII table  printf() format strings.
Graphics in Python On entry: Run Python 2.78 from N: drive/computing and ICT VLE: Computing home page - check your feedback Success criteria: ●Understands.
CompSci Today’s Topics Computer Science Noncomputability Upcoming Special Topic: Enabled by Computer -- Decoding the Human Genome Reading Great.
The Church-Turing Thesis Chapter Are We Done? FSM  PDA  Turing machine Is this the end of the line? There are still problems we cannot solve:
CS 461 – Nov. 2 Sets Prepare for ATM finite vs. infinite Infinite sets
Introduction to Computing Science and Programming I
Busch Complexity Lectures: Undecidable Problems (unsolvable problems)
Undecidable Problems (unsolvable problems)
Chapter 3: The CHURCH-Turing thesis
CSE 311 Foundations of Computing I
Decidable Languages Costas Busch - LSU.
Last Class We Covered Dictionaries Hashing Dictionaries vs Lists
Discrete Math for CS CMPSC 360 LECTURE 43 Last time: Variance
Turing Machines and the MANY things computers can't compute... !
CSE 311: Foundations of Computing
Class 24: Computability Halting Problems Hockey Team Logo
Theory of Computability
Theory of Computability
CSE 311: Foundations of Computing
Theory of Computability
Presentation transcript:

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

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

E-Portfolios !

IS313 Finishing Schedule Monday, Dec. 6 Today! In-class project presentations Tuesday, Dec. 7 Intermediate progress report due with presentation slides Monday, Dec. 13 "Office hours" 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…

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

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

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

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

the iPhone's icon for Google Maps …

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

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

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

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

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

Thus… Inf( fs, inp ) can not exist… 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

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

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

E-Portfolios !

IS313 Finishing Schedule Monday, Dec. 6 Today! In-class project presentations Tuesday, Dec. 7 Intermediate progress report due with presentation slides Monday, Dec. 13 "Office hours" 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…

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