Ch04
Student: _
1.
The basic planning cycle goes in one dimension - into the future.
True False
2.
Situational analysis, as part of the formal planning process, focuses on internal forces at work within the
organization and examines influences from the ex
Ch02
Student: _
1.
The external environment includes all relevant forces outside the organization's boundaries.
True False
2.
Organizations are open systems that affect and are affected by their external environments.
True False
3.
A firm's competitive en
CS 21
Decidability and Tractability
Winter 2015
Problem Set 7
Out: March 4
Due: March 11
Reminder: you are encouraged to work in groups of two or three; however you must turn in your
own write-up and note with whom you worked. You may consult the course n
CS 21
Decidability and Tractability
Winter 2015
Problem Set 6
Out: February 25
Due: March 4
Reminder: you are encouraged to work in groups of two or three; however you must turn in your
own write-up and note with whom you worked. You may consult the cours
CS 21
Decidability and Tractability
Winter 2015
Problem Set 5
Out: February 18
Due: February 25
Reminder: you are encouraged to work in groups of two or three; however you must turn in your
own write-up and note with whom you worked. You may consult the c
CS 21
Decidability and Tractability
Winter 2015
Problem Set 4
Out: February 11
Due: February 18
Reminder: you are encouraged to work in groups of two or three; however you must turn in your
own write-up and note with whom you worked. You may consult the c
Outline
Challenges to the (extended) ChurchTuring Thesis
CS21
Decidability and Tractability
randomized computation
quantum computation
Lecture 27
March 11, 2015
March 11, 2015
CS21 Lecture 27
1
March 11, 2015
CS21 Lecture 27
For use later
Extended Chur
CS 21
Decidability and Tractability
Winter 2015
Problem Set 3
Out: January 28
Due: February 4
Reminder: you are encouraged to work in groups of two or three; however you must turn in your
own write-up and note with whom you worked. You may consult the cou
Outline
Challenges to the (extended) ChurchTuring Thesis
CS21
Decidability and Tractability
randomized computation
quantum computation
Lecture 26
March 9, 2015
March 9, 2015
CS21 Lecture 26
1
Communication complexity
2
Common to insert probabilistic:
CS 21
Decidability and Tractability
Winter 2015
Problem Set 2
Out: January 21
Due: January 28
Reminder: you are encouraged to work in groups of two or three; however you must turn in your
own write-up and note with whom you worked. You may consult the cou
CS 21
Decidability and Tractability
Winter 2015
Problem Set 1
Out: January 14
Due: January 21, 2am
Reminder: you are encouraged to work in groups of two or three; however you must turn in your
own write-up and note with whom you worked. You may consult th
Outline
the class NP
NP-complete problems: Hamilton path and
cycle,Traveling Salesperson Problem
NP-complete problems: subset sum
NP-complete problems: NAE-3-SAT, max-cut
CS21
Decidability and Tractability
Lecture 21
February 25, 2015
February 25, 201
CS 21
Decidability and Tractability
Winter 2015
Midterm
Out: February 4
Due: February 11
This is a midterm. You may consult only the course notes and the text (Sipser). You may not
collaborate. The full honor code guidelines can be found in the course syl
Outline
the class PSPACE
a PSPACE-complete problem
PSPACE and 2-player games
CS21
Decidability and Tractability
Challenges to the (extended) ChurchTuring Thesis
Lecture 24
March 4, 2015
March 4, 2015
randomized computation
quantum computation
CS21 L
Outline
the class NP
3-SAT is NP-complete (finishing up)
NP-complete problems: independent set,
vertex cover, clique
NP-complete problems: Hamilton path and
cycle,Traveling Salesperson Problem
CS21
Decidability and Tractability
Lecture 20
February 23,
Outline
the class NP
NP-complete problems: subset sum
NP-complete problems: NAE-3-SAT, max-cut
CS21
Decidability and Tractability
the class co-NP
the class NP coNP
Lecture 22
February 27, 2015
February 27, 2015
CS21 Lecture 22
1
February 27, 2015
Sub
Outline
the class PSPACE
PSPACE and 2-player games
CS21
Decidability and Tractability
Challenges to the (extended) ChurchTuring Thesis
Lecture 25
March 6, 2015
March 6, 2015
CS21 Lecture 25
randomized computation
quantum computation
1
March 6, 2015
P
Outline
the class co-NP
the class NP coNP
CS21
Decidability and Tractability
the class PSPACE
Lecture 23
March 2, 2015
March 2, 2015
a PSPACE-complete problem
PSPACE and 2-player games
CS21 Lecture 23
1
March 2, 2015
coNP
x
L
x
qreject
March 2, 2015
Outline
hardness and completeness
CS21
Decidability and Tractability
an EXP-complete problem
the class NP
Lecture 19
February 20, 2015
February 20, 2015
CS21 Lecture 19
an NP-complete problem
alternate characterization of NP
3-SAT is NP-complete
1
H
Outline
on to Computational Complexity
CS21
Decidability and Tractability
The complexity class P
examples of problems in P
Lecture 17
February 13, 2015
The complexity class EXP
Time Hierarchy Theorem
February 13, 2015
CS21 Lecture 17
1
February 13, 20
Outline
CS21
Decidability and Tractability
Gdel Incompleteness Theorem
Lecture 16
February 11, 2015
on to Complexity
February 11, 2015
CS21 Lecture 16
1
February 11, 2015
CS21 Lecture 16
2
Background
Hilberts program (1920s):
formalize mathematics in ax
Outline
CS21
Decidability and Tractability
Lecture 14
February 6, 2015
February 6, 2015
CS21 Lecture 14
undecidable problems
1
computation histories
surprising contrasts between
decidable/undecidable
Rices Theorem
Post Correspondence problem
February 6, 2
Outline
CS21
Decidability and Tractability
Lecture 15
February 9, 2015
Post Correspondence problem (contd)
a non-RE and non-co-RE language
the Recursion Theorem
Gdel Incompleteness Theorem
(midterm due Wednesday at noon)
February 9, 2015
CS21 Lecture 15
1
Outline
CS21
Decidability and Tractability
equivalence of NPDAs and CFGs
(finishing up)
non context-free languages
Lecture 7
January 21, 2015
January 21, 2015
CS21 Lecture 7
1
NPDA, CFG equivalence
2
Proof of ( ): L is recognized by a NPDA
implies L is de
Outline
CS21
Decidability and Tractability
Lecture 9
January 26, 2015
January 26, 2015
CS21 Lecture 9
Turing Machines and variants
1
multitape TMs
nondeterministic TMs
Church-Turing Thesis
decidable, RE, co-RE languages
January 26, 2015
CS21 Lecture 9
So
Problem Set + grading
3 points for each part of each problem
PS1: 24 points total
CS21
Decidability and Tractability
mean: 19.9 median: 20.5
2014: 17.2, 19.5
2013: 19.5, 20
2012: 19.6, 21
2011: 18.7, 19
2010: 19.3, 20
2009: 20.0, 21
Lecture 10
January
Outline
CS21
Decidability and Tractability
Lecture 11
January 30, 2015
January 30, 2015
CS21 Lecture 11
1
decidable, RE, co-RE languages
the Halting Problem
reductions
many-one reductions
January 30, 2015
non-RE languages
the set of all TMs is countable