Homework 5
Due: Friday, May 10, 2013
CS 103, Spring 2012-2013
General Notes
These questions require thought, but do not require long answers. Please be
as concise as possible.
Please include your SUNet ID in your submission. (This is your WebAuth login
Homework 1
Due: Friday, April 12, 2013
CS 103 Spring 2012-2013
Notes
These questions require thought, but do not require long answers. Please be
as concise as possible.
Please include your SUNet ID in your submission. (This is your WebAuth login
name, l
Welcome to CS103!
Two Handouts
Today:
Course Overview
Introduction to Set Theory
The Limits of Computation
Course Staff
Keith Schwarz (htiek@cs.stanford.edu)
Kyle Brogle (broglek@stanford.edu)
Maurizio Calo Caligaris (maurizio@cs.stanford.edu)
Julius Chen
Outline
CS103 Introduction and Set Basics
Course Introduction and Overview
Purpose and Content
Course Administration
David L. Dill
Department of Computer Science
Stanford University
Sets
Basics
1 / 31
Purpose of the class
2 / 31
Topics
Our goal is to get
Turing Machines
Hello
Hello Condensed
Condensed Slide
Slide Readers!
Readers!
This
This lecture
lecture isis
show
show how
how each
each
and
and how
how
condense
condense
the
the
the
the
almost
almost
Turing
Turing
entirely
entirely animations
animations
Mathematical Logic
Part One
Announcements
Problem Set 3 checkpoint due right now.
Problem Set 2 due now with a late day.
Solutions distributed at end of lecture.
One Final Note on the Pigeonhole Principle
Pigeonholing Injective Functions
Consider a functi
Finite Automata
Midterm Logistics
Midterm is next Tuesday, February 12 from
7PM 10PM (location TBA).
Open-book, open-note, open-computer,
closed-network.
Covers material up through and including
Wednesday's lecture.
Practice exam available now; solutions
Announcements
Graded homeworks will be returned at end of lecture.
Recursion and structural induction
David L. Dill
Department of Computer Science
Stanford University
1 / 26
Outline
2 / 26
Recursive denitions on natural numbers
Recursive denitions are cl