COMP 360
Spring 2017
| Section:
01
02
|
| This course may be repeated for credit. |
This course covers special topics in computer science. Topics will vary according to the instructor. |
|
| Credit: 1 |
Gen Ed Area Dept:
NSM MATH |
| Course Format: Lecture | Grading Mode: Graded |
| Level: UGRD |
Prerequisites: COMP212 AND MATH228 |
|
Fulfills a Requirement for: (COMP)(MATH)(NS&B)(STS) |
|
Past Enrollment Probability: 50% - 74% |
| SECTION 01 |
Major Readings: Wesleyan RJ Julia Bookstore
TBA
|
Examinations and Assignments:
TBA |
Additional Requirements and/or Comments:
In this course we will give an introduction to logic as used in Computer Science. This will include Natural deduction, Sequent Calculus (especially) and the Curry-Howard isomorphism. We will discuss uniform proofs and their connection with resolution (the main proof-technique used in automated deduction). We will also introduce semantics and give soundness and completeness theorems. We will apply these ideas to logic programming and study the Prolog programming language and some of its variants. This language has been extensively used in automated deduction and artificial intelligence. We will use one textbook: "Programming in Prolog" by Clocksin and Mellish (5th edition), and a number of handouts as our main sources. |
| Instructor(s): Lipton,James Times: ..T.R.. 02:50PM-04:10PM; Location: SCIE139; |
| Total Enrollment Limit: 30 | | SR major: 10 | JR major: 10 | | |
| Seats Available: 17 | GRAD: X | SR non-major: 0 | JR non-major: 0 | SO: 10 | FR: 0 |
| Drop/Add Enrollment Requests | | | | | |
| Total Submitted Requests: 0 | 1st Ranked: 0 | 2nd Ranked: 0 | 3rd Ranked: 0 | 4th Ranked: 0 | Unranked: 0 |
| SECTION 02 |
Major Readings: Wesleyan RJ Julia Bookstore
Same as Section 01 Above |
| Examinations and Assignments: Same as Section 01 Above |
Additional Requirements and/or Comments:
Topic: Quantum Information Systems.
Models of computation that exploit quantum principles permit algorithms that, as far as we know, cannot be efficiently simulated by any other physically realizable model of computation. Theories of quantum information systems are conventionally presented in terms of vector spaces over the complex numbers. An alternative approach is to give a purely algebraic presentation formulated in the language of category theory. This permits a more modular study of quantum systems, and enables the generalization of many results to other domains, such as control theory. It also illustrates a deep and still poorly understood connection between algebra and abstract geometry. |
| Instructor(s): Morehouse,Edward Times: .M.W... 02:50PM-04:10PM; Location: SCIE113; |
| Total Enrollment Limit: 30 | | SR major: 10 | JR major: 10 | | |
| Seats Available: 18 | GRAD: X | SR non-major: 0 | JR non-major: 0 | SO: 10 | FR: 0 |
| Web Resources: Syllabus |
| Drop/Add Enrollment Requests | | | | | |
| Total Submitted Requests: 0 | 1st Ranked: 0 | 2nd Ranked: 0 | 3rd Ranked: 0 | 4th Ranked: 0 | Unranked: 0 |
|