0306-slides

0306-slides - CPSC 121: Models of Computation Instructor:...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
CPSC 121: Models of Computation Instructor: Bob Woodham woodham@cs.ubc.ca Department of Computer Science University of British Columbia Lecture Notes 2008/2009, Section 203 CPSC 121: Models of Computation
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Menu March 6, 2009 Topics: Induction Examples (cont’d) Reading: Today: Epp 4.1 (as background) Epp 4.2–4.4 Reminders: Assignment 3 due Friday, March 13 (by 17:00) Midterm, Marked Assignment 2 available in tutorials — solutions posted to Sample Solutions area of the course WebCT site Lab 6 week of March 9–13 READ the WebCT Vista course announcements board CPSC 121: Models of Computation
Background image of page 2
Principle of Mathematical Induction As a rule of inference, we write P ( 1 ) k Z + P ( k ) P ( k + 1 ) n Z + P ( n ) As a tautology, we write [ P ( 1 ) ∧∀ k Z + ( P ( k ) P ( k + 1 ))] → ∀ n Z + P ( n ) CPSC 121: Models of Computation
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Principle of Strong Mathematical Induction As a rule of inference, we write P ( 1 ) k Z + ( P ( 1 ) P ( 2 ) . . . P
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 7

0306-slides - CPSC 121: Models of Computation Instructor:...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online