Special Topics in Computer Science
COMP 360
Fall 2013
| Section:
01
02
|
| This course may be repeated for credit. |
Topics vary by offering; recent topics have included information theory, advanced algorithms, and logic programming. |
|
| Credit: 1 |
Gen Ed Area Dept:
NSM MATH |
| Course Format: Lecture | Grading Mode: Graded |
| Level: UGRD |
Prerequisites: COMP212 |
|
Fulfills a Requirement for: (COMP)(MATH)(NS&B)(STS) |
|
Past Enrollment Probability: Not Available |
| SECTION 01 |
Major Readings: Wesleyan RJ Julia Bookstore
To be announced.
|
Examinations and Assignments:
To be announced. |
Additional Requirements and/or Comments:
SECTION 01 DESCRIPTION:
There is a strong correspondence between mathematics and programming, under which mathematical proofs correspond to programs. A _proof assistant_ is a tool that a mathematician/programmer can use to represent proofs/programs, in such a way that a computer can verify whether or not they are correct. The use of proof assistants in math and computer science is becoming ever more important for managing the increasing complexity of proofs and programs. Proof assistants have been used to check significant mathematical theorems, such as the Four Color Theorem and the Feit-Thompson Odd-Order Theorem, as well as large pieces of software, such as a C compiler and the definition of the Standard ML programming language. In this course, students will learn to use proof assistants to write computer-checked programs and proofs. Specific topics will include verifying functional and imperative programs using the Agda programming language, and formalizing mathematics using Homotopy Type Theory. Students will be assessed by homework assignments and by an end-of-semester project, where they will write a computer-checked program or proof of their choice. |
| Instructor(s): Licata,Dan Times: ..T.R.. 10:30AM-11:50AM; Location: SCIE137; |
| Total Enrollment Limit: 30 | | SR major: 10 | JR major: 10 | | |
| Seats Available: 21 | 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 | | Special Attributes: CQC |
Major Readings: Wesleyan RJ Julia Bookstore
Same as Section 01 Above |
Examinations and Assignments:
Weekly or near-weekly assignments; one major project/paper. |
Additional Requirements and/or Comments:
In this section, Computer Science students will team up with students in other disciplines to work on a research problem that requires significant computation-intensive data analysis. All students will learn the fundamental techniques of such analysis. The specific techniques to be learned will be determined by the research problems; some that we might cover are clustering, component analysis, Bayesian analysis, and time-series analysis. The Computer Science students will be responsible for developing a well-written software platform that can be used for the project-specific analysis. The students from other disciplines will fully develop their research proposal and produce an appropriate research paper describing the project and its results.
This section of COMP 360 meets with COMP 260. COMP 360 is intended for Computer Science majors. Enrollment is POI only. POI requests will be approved during Drop/Add. However, students wishing to enroll must submit a statement of interest and background by 31 May 2013; contact the professor by e-mail for details. |
| Instructor(s): Danner,Norman Times: ..T.R.. 01:10PM-02:30PM; Location: SCIE74; |
Permission of Instructor Required
Enrollment capacity: 9 | Permission of instructor will be granted during the drop/add period. Students must submit either a ranked or unranked drop/add request for this course. |
| Drop/Add Enrollment Requests | | | | | |
| Total Submitted Requests: 0 | 1st Ranked: 0 | 2nd Ranked: 0 | 3rd Ranked: 0 | 4th Ranked: 0 | Unranked: 0 |
|
|