1 CS1001 Lecture 20. 2 Overview Projects Projects More on Cantor’s Proofs More on Cantor’s Proofs Predicate Logic Predicate Logic.

Slides:



Advertisements
Similar presentations
Research Project Discussion April 16 th and 17 th, 2007.
Advertisements

Implementing Parallel Graph Algorithms Spring 2015 Implementing Parallel Graph Algorithms Lecture 1: Introduction Roman Manevich Ben-Gurion University.
Introduction to CS 491 / 2 Senior Design Project I / II Prof. Dr. H. Altay Güvenir.
CSCI 11 Google’s Technology and its Impact on our Culture David Irwin Winter Study 2008 January 5, 2008.
CS510 Concurrent Systems Course Overview. CS510 - Concurrent Systems 2 About the Instructor  Instructor – Jonathan Walpole o Professor at PSU o Research.
CPSC 322, Lecture 20Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Computer Science cpsc322, Lecture 20 (Textbook.
Logistics: –My office hours: T, Th 4-5pm or by appointment –Class Web page:
1 CS1001 Lecture Overview Java Programming Java Programming Midterm Review Midterm Review.
CS 331 / CMPE 334 – Intro to AI CS 531 / CMPE AI Course Outline.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
CS533 Concepts of Operating Systems Class 1 Course Overview and Entrance Exam.
Math 105: Problem Solving in Mathematics. Course Description This course introduces students to the true nature mathematics, what mathematicians really.
CpE 419 / SysEng 419 Network-Centric Systems Architecting and Engineering Dr. Cihan Dagli and Dr. Ann Miller Course Overview 23 August 2005.
CSC 171 – FALL 2004 COMPUTER PROGRAMMING LECTURE 0 ADMINISTRATION.
ESE 570 Final Project Due Wednesday, May 5, 2004, 4:30 pm.
1 CS1001 Lecture Overview Midterm Midterm OOP Wrap-up OOP Wrap-up Functions, Hilbert’s Hotel Functions, Hilbert’s Hotel.
E-1 University of Washington Computer Programming I Lecture 6: Conditionals © 2000 UW CSE.
EECS 395/495 Algorithmic Techniques for Bioinformatics General Introduction 9/27/2012 Ming-Yang Kao 19/27/2012.
Adapted from Discrete Math
©2003 Pearson Education, Inc., publishing as Longman Publishers. Study Skills Topic 13 Preparing & Taking Exams PowerPoint by JoAnn Yaworski.
CS 3305 Course Overview. Introduction r Instructor: Dr Hanan Lutfiyya r Office: MC 355 r hanan at csd dot uwo ca r Office Hours: m Drop-by m Appointment.
University of Louisville Inaugural i2a Institute: Developing Critical Thinkers May 29, 2009 Social Sciences & Critical Thinking.
CS 160 Introduction to Computer Science Andrew Scholer
Foundations of Computing I CSE 311 Fall CSE 311: Foundations of Computing I Fall 2014 Lecture 1: Propositional Logic.
IENG 471 Facilities Planning
Lecture 3 THE KEY SKILLS TESTED IN A DISSERTATION.
Institute for Experimental Physics University of Vienna Institute for Quantum Optics and Quantum Information Austrian Academy of Sciences Undecidability.
Dana Nau: CMSC 722, AI Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
The Birthday Problem Section The Birthday Problem What is the probability that in a group of 37 students at least two of them share a birthday?
Introduction to CS Senior Design Project I / II Prof. Dr. H. Altay Güvenir.
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
The Steps Involved Select a Company who has internationalised or is intending to Age of Internationalisation event Check existing papers about this coy.
HE 520: Higher Education Laws and Regulations Unit One Seminar Pre-Seminar Welcome to HE 520: Higher Education Laws and Regulations, Unit One Seminar Seminar.
Course grading Project: 75% Broken into several incremental deliverables Paper appraisal/evaluation/project tool evaluation in earlier May: 25%
MATH 224 – Discrete Mathematics
CS511: Artificial Intelligence II
Most of contents are provided by the website Introduction TJTSD66: Advanced Topics in Social Media Dr.
What is a paragraph? A paragraph is a group of sentences related to a particular topic, or central theme. Every paragraph has a key concept or main idea.
Welcome! Hello and welcome to English Composition 102, Introduction to Literature. I am looking forward to exploring, writing, and discussing literature.
CS533 Concepts of Operating Systems Class 1 Course Overview.
Discrete Structures – CNS 2300
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
Now what? 1.  I have short-listed projects I am interested in  I know the types of projects I would like to pursue  I have an idea of the resources.
Chapter 4 Computation Chapter 4: Computation.
Logical Thinking CS 104 9/12/11. Agenda Today  College Board survey reminder  Note: Simple “how to” guide on Scratch posted on eLearning  Review HW.
Lecture 1 Page 1 CS 236 Online Introduction CS 236 On-Line MS Program Networks and Systems Security Peter Reiher.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
PROBLEM SOLVING AND PROGRAMMING ISMAIL ABUMUHFOUZ | CS 170.
Introduction to CSCI 1311 Dr. Mark C. Lewis
Knowledge Representation Techniques
MMW 15 TA: Kyle Knabb Week 1.
Computer Science cpsc322, Lecture 20
Introduction to CS Senior Design Project I / II
Group Assignment Instructions
Seminar will begin at top of the hour
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
Discrete Structures for Computer Science
CS 201 – Data Structures and Discrete Mathematics I
CS 201 – Data Structures and Discrete Mathematics I
Introduction to CS Senior Design Project I / II
Introduction to CS Senior Design Project I / II
Literacy Test Preparation
CS 160 Introduction to Computer Science
Logic for Computer Security Protocols
Assignment-2 due now Enterprise Architecture Conference Sat. Oct 27
Literacy Test Preparation
Tonga Institute of Higher Education IT 141: Information Systems
Computer Science cpsc322, Lecture 20
Introduction to CS Senior Design Project I / II
Homework Reading Machine Projects Labs
Presentation transcript:

1 CS1001 Lecture 20

2 Overview Projects Projects More on Cantor’s Proofs More on Cantor’s Proofs Predicate Logic Predicate Logic

3 Goals Learn some predicate logic Learn some predicate logic

4 Assignments Brookshear: Chapter 11 Brookshear: Chapter Read linked documents on these slides (slides will be posted in courseworks) Read linked documents on these slides (slides will be posted in courseworks)

5 Projects Technical Project Technical Project –An implementation or investigation into technical subject matter. Expect to spend at least 15 Hours on this. –Grade will be based on how thoroughly you combine concepts that have been used throughout this course in selecting and designing your project

6 Technical Project Examples –Robocode: A more complex robot. If you choose this, discuss why your implementation is effective. Do some brief reading in the AI section of the book and comment on what type of AI you are using –Programming: Choose a logic problem (see me if you want examples) and write a program to solve it. Discuss efficiency. –Web Design/Usability: Design a site and discuss its goals and usability. Why does your design match the application for which it was intended? –Object Modeling: Model a problem using object oriented design methodologies –Networks: Examine a problem (or invent one) and discuss various network protocol options –Architecture: Investigate and compare some modern machine architectures –Semiconductors: Summarize the newest methods for creating semiconductors

7 Final Paper The final paper is similar in scope to the technical project, but it can be an elaboration on the social consequences of technology. It can also discuss a theoretical concept in additional depth. The final paper is similar in scope to the technical project, but it can be an elaboration on the social consequences of technology. It can also discuss a theoretical concept in additional depth. The topic can be tied to your technical project if you like The topic can be tied to your technical project if you like Should run 5-7 pages double spaced Should run 5-7 pages double spaced

8 Deadlines (or submit in class) a brief description of your idea by next Wednesday (April 14 th ) for both your tech project and paper (or submit in class) a brief description of your idea by next Wednesday (April 14 th ) for both your tech project and paper Do not worry if it is rough; I will provide comments Do not worry if it is rough; I will provide comments

9 Diagonalization

10 Propositional Logic Information definition: a proposition is a statement of fact Information definition: a proposition is a statement of fact –“It is raining” (english) Connectives: operators on propositions Connectives: operators on propositions –And, or, not, implies, if and only if Raining

11 Theories A Theory in propositional logic is a set of constants, functions, relations and axioms. A Theory in propositional logic is a set of constants, functions, relations and axioms. Example: (theory of ordered integers) Example: (theory of ordered integers) –Constants: non-negative integers –Function: +, Relation: < –Axioms:

12 Smullyan (Raymond) On 1 April 1925, I was sick in bed... In the morning my brother Emile (ten years my senior) came into my bedroom and said: "Well, Raymond, today is April Fool's Day, and I will fool you as you have never been fooled before!" I waited all day for him to fool me, but he didn't. Emile had fooled him by not fooling him! Smullyan writes [1]:- Emile had fooled him by not fooling him! Smullyan writes [1]:- I recall lying in bed long after the lights were turned out wondering whether or not I had really been fooled.

13 A Puzzle Introduction (Smullyan) There are two casket makers, Bellini and Cellini There are two casket makers, Bellini and Cellini –All Bellini caskets have true inscriptions –All Cellini caskets have false inscriptions

14 A Puzzle (Smullyan)

15 Paradox? Can this be solved? Can this be solved? If so, how? If so, how? –Formulate the problem as a logic problem and evaluate the expressions –If you can derive both “truth” and “falsehood” from one single assumption, you’ve found a paradox