Back to Results
First PageMeta Content
Theory of computation / Theoretical computer science / Computability theory / Computer science / Alan Turing / Turing machine / Computational complexity theory / Computability / Reduction / Halting problem / Complexity / ChurchTuring thesis


MCS 441 – Theory of Computation I Syllabus Lev Reyzin SpringTime and Location: M-W-F, 12:00-12:50pm, Lincoln Hall (TH) 205
Add to Reading List

Document Date: 2016-01-11 11:14:04


Open Document

File Size: 96,59 KB

Share Result on Facebook