INTRO AND REGULAR LANGS

Jan 28: Admin, Intro to Theory of Comp

Jan 28 DFAs

Jan 30 DFAs for Arithmetic Tricks

Jan 30 DFA Closure

Feb 4 NFAs

Feb 4 NFA Closure

Feb 6 Number of States

Feb 6 Small NFAs

Feb 11 Reg Expressions (regex)

Feb 11 HW02 solutions

Feb 13-18 regex closure

Feb 18 Recording From Feb 18

Feb 18-20 Proving Langs Not Reg

Feb 25 The 3-4-5 problem

Feb 25,27 CFL's

Feb 27 HW03 sol

Feb 27 HW04 sol

March 4 CFG's For Finite Unary Languages

Syn Correct C Programs Undecdable?

March 6 HW05 sol

March 11 CFL in P

March 13 Context Sensitive Languages

OLD MIDTERM

GUIDELINES FOR MIDTERM

March 25 Mid Review Reg, Mid Review CFL

March 27 hw06sol, hw07sol

April 1 Midterm1

April 3 Midterm Solutions

P, NP, ETC.

April 3,8 DTIME, P, EXP, NP SLIDES

April 8 More on NPC

April 15,17 Cook-Levin Thm

April 17 CLIQ TO SAT

April 17 CLIQ TO SAT

April 17 Hw10 Solutions IF HAVE TIME

April 22 Closure Properties of P and NP

April 22 Functions and Sets

April 24 Is Factoring NPC?

OPTIONAL Is Graph Isomorphism NPC?

OPTIONAL SAT Variants and Cryarithms

OPTIONAL SAT SOLVERS

DECIDABLE & UNDECIDABLE SETS

April 29 Decidable and Undecidable

Dr. Suess Halting Problem http://www.cs.umd.edu/~dml/seuss-halt.pdf

More on Hilberts Tenth Problem slides/h10theory.pdf

Papaer about H10 PAPER

Primitive Recursive Functions slides/primrectalk.pdf

WS1S S1S Decidable

WS2S S2S Decidable

Link to the MONA website-dec of WS2S

Undec problems about CFG's slides/cfgund.pdf

Theory of (Q,<) slides/qlesstalk.pdf

Theory of (M,<) slides/mless.pdf

Mr Ed Theme song

Godel's Inc Theorem

Kolm Comp

Emptyness and Fullness Problems

Bounded Queries in Recursion Theory