A course on computation, computability, and complexity.
Message Of The Day
9/3 Lab Assignments Posted
The lab assignments are up!
8/30 Time and Space
Class will be on Mondays and Wednesdays from 9:30 to 10:50 AM in CIT 368.
8/27 Welcome to Models of Computation!
CSCI0510 (also known as CS51) is a core undergraduate Computer Science course on the foundations of computing. A variety of formal models for machines and languages are explored including machines with memory (the finite-state, random-access and Turing machines), language models (regular expressions and formal languages) and complexity classes identifying problems with the same general complexity, such as the NP-complete problems. In particular the course covers one of the great mathematical theorems of the 20th century, the halting problem, and what (we hope) will be one of the great mathematical theorems of the 21st century, P != NP.
The course has lectures, written assignments, labs, and exams. Its prerequisite is CSCI220, Introduction to Discrete Mathematics. CSCI510 serves as a prerequisite for higher level CS classes.