Ryan Dougherty

Ryan Dougherty is a professor at Colgate University.

This channel is no longer maintained (SEE DESCRIPTION FOR LINKS)
This channel is no longer maintained (SEE DESCRIPTION FOR LINKS)
Chris Jansing is having a hard day
Chris Jansing is having a hard day
Final Exam Review - COSC304 Theory of Computing 4/29
Final Exam Review - COSC304 Theory of Computing 4/29
CLIQUE, 3SAT - COSC304 Theory of Computing 4/27
CLIQUE, 3SAT - COSC304 Theory of Computing 4/27
NP-Hard, NP-Complete, CNFSAT - COSC304 Theory of Computing 4/24
NP-Hard, NP-Complete, CNFSAT - COSC304 Theory of Computing 4/24
P and NP - COSC304 Theory of Computing 4/22
P and NP - COSC304 Theory of Computing 4/22
E_LBA, ALL_CFG - COSC304 Theory of Computing 4/20
E_LBA, ALL_CFG - COSC304 Theory of Computing 4/20
Rice's Theorem Proof, A_LBA - COSC304 Theory of Computing 4/17
Rice's Theorem Proof, A_LBA - COSC304 Theory of Computing 4/17
Perfect Hash Families - COSC480 Interaction Testing 4/15
Perfect Hash Families - COSC480 Interaction Testing 4/15
E_TM, EQ_TM, Rice's Theorem Intro - COSC304 Theory of Computing 4/14
E_TM, EQ_TM, Rice's Theorem Intro - COSC304 Theory of Computing 4/14
A_CFG, E_CFG, A_TM Undecidable - COSC304 Theory of Computing 4/13
A_CFG, E_CFG, A_TM Undecidable - COSC304 Theory of Computing 4/13
Encodings, A_DFA, A_NFA, A_REX, E_DFA, EQ_DFA - COSC304 Theory of Computing 4/10
Encodings, A_DFA, A_NFA, A_REX, E_DFA, EQ_DFA - COSC304 Theory of Computing 4/10
Nondeterministic TMs, Church Turing Thesis - COSC304 Theory of Computing 4/8
Nondeterministic TMs, Church Turing Thesis - COSC304 Theory of Computing 4/8
Cut and Paste Techniques - COSC480 Interaction Testing 4/8
Cut and Paste Techniques - COSC480 Interaction Testing 4/8
Configurations, Multitape TMs - COSC304 Theory of Computing 4/01
Configurations, Multitape TMs - COSC304 Theory of Computing 4/01
Combinatorial Techniques - COSC480 Interaction Testing 4/6
Combinatorial Techniques - COSC480 Interaction Testing 4/6
Turing Machines Pt. 1 - COSC304 Theory of Computing 3/30
Turing Machines Pt. 1 - COSC304 Theory of Computing 3/30
Locating Arrays - COSC480 Interaction Testing 3/30
Locating Arrays - COSC480 Interaction Testing 3/30
Deterministic Context-Free Languages - COSC304 Theory of Computing 3/11
Deterministic Context-Free Languages - COSC304 Theory of Computing 3/11
CFL Closure, Deterministic PDAs - COSC304 Theory of Computing 3/9
CFL Closure, Deterministic PDAs - COSC304 Theory of Computing 3/9
Genetic Algorithms for Covering Arrays - COSC480 Interaction Testing 3/9
Genetic Algorithms for Covering Arrays - COSC480 Interaction Testing 3/9
Pumping Lemma for CFLs Part 1 - COSC304 Theory of Computing 3/04
Pumping Lemma for CFLs Part 1 - COSC304 Theory of Computing 3/04
Pumping Lemma for CFLs Part 2 - COSC304 Theory of Computing 3/06
Pumping Lemma for CFLs Part 2 - COSC304 Theory of Computing 3/06
PDA to CFG - COSC304 Theory of Computing 3/2
PDA to CFG - COSC304 Theory of Computing 3/2
Metaheuristics - COSC480 Interaction Testing 3/2
Metaheuristics - COSC480 Interaction Testing 3/2
CFG to PDA Conversion - COSC304 Theory of Computing 2/28
CFG to PDA Conversion - COSC304 Theory of Computing 2/28
Chomsky Normal Form Pt. 2, PDAs - COSC304 Theory of Computing 2/26
Chomsky Normal Form Pt. 2, PDAs - COSC304 Theory of Computing 2/26
Chomsky Normal Form Pt. 1 - COSC304 Theory of Computing 2/24
Chomsky Normal Form Pt. 1 - COSC304 Theory of Computing 2/24
Post-Optimization of Covering Arrays - COSC480 Interaction Testing 2/24
Post-Optimization of Covering Arrays - COSC480 Interaction Testing 2/24
DFA for a^m b^n where m + n is even - Theory of Computation
DFA for a^m b^n where m + n is even - Theory of Computation