COMPSCI 350 - Mathematical Foundations of Computer Science
Faculty
Science
Department
Computer Science
Points:
15
Available Semesters:
{}
Course Components
Labs
Tutorials
Lectures
Exam
TBLs
Workshops
Description: The aim of this course is to present mathematical models for programming languages and computation, and derive some theorems regarding what can and cannot be computed. Abstract programming languages (finite automata, context-free grammars, Turing and register machines) are studied. Basic concepts for programming languages, limits on computational power and algorithmic complexity are presented. Church-Turing thesis and quantum computing are briefly and critically discussed.
Prerequisites / Restrictions
Prerequisite: COMPSCI 220 or PHIL 222, and COMPSCI 225 or MATHS 254
Average Rating From 0 Reviews
Teaching Quality
-
Content Quality
-
Workload
-
Difficulty
-
0% - Would Recommend
0% - Would Not Recommend
Reviews