Foundations of ComputationDepartment of Mathematics and Computer Science Hobart and William Smith Colleges Fall, 2010. Instructor: David J. Eck. Monday, Wednesday, Friday, 3:00 -- 3:55 PM. Room Eaton 110.
About This Course
This course surveys the mathematical foundations of computer science. These foundations include some basic mathematical concepts, such as logic, sets, and functions. They also include some ideas more specific to computing, such as languages, grammars, and abstract machines.
The prerequisite for the course is CPSC 124: Introductory Programming. We will use the Java programming language in some examples. Furthermore, there will be a few homework assignments that require writing programs in Java. However, for the most part, this is a mathematics course, and the majority of the assignments will be mathematical.
You do not need to purchase a textbook for the course. The textbook will be handed out in class. A copy is also available in PDF format on the Internet at http://math.hws.edu/FoundationsOfComputation. The text was written by Professors David Eck and Carol Critchlow. The book has five chapters:
- Chapter 1: Logic and Proof.
- Chapter 2: Sets, Functions, and Relations.
- Chapter 3: Regular Expressions and Finite Automata.
- Chapter 4: Grammars.
- Chapter 5: Turing Machines and Computability.
The first two chapters cover general mathematical background. This material is often covered in a course on "Discrete Mathematics," along with other topics such as probability and graph theory. The material that we've chosen for inclusion in these chapters is the most fundamental. The final three chapters cover material that forms the theoretical foundation of computer science. This material is often covered in a course called "Automata Theory" or "Formal Language Theory." It deals with computation, languages, and automata and with their interrelationships. The word "automata" is just another term for "computing machines," and the languages that we are interested in here are the artificial languages that are used to program or describe computing machines.
Although the course is mathematical, the first four chapters, at least, are highly relevant to applications of computer science. There are sections throughout these chapters that cover applications. The chapter on Turing machines probably has few practical applications, but it is right at the theoretical heart of computer science, and no one can claim to truly understand computers without knowing something about the abstract machines covered in that chapter.
There is too much material in the textbook to be covered in a one semester course. In order to allow sufficient time for the last three chapters, we will omit some of the material from Chapters 1 and 2. In particular, we will not cover recursive definitions (Section 1.10) or relations (Sections 2.7 and 2.8), and we will not cover all the details of proof (Sections 1.6 through 1.9) and functions (Sections 2.4 and 2.5).
There will be weekly homework assignments, which will be collected and graded. Some of the assignments will involve writing computer programs, but this is not primarily a programming class, and none of the programming assignments will be very large or complex. The mathematical assignments will be similar to the end-of-section exercises in the textbook, but most will not be taken directly form the book.
The assignments for each week will be collected the following week. I will usually hand out solutions to the homework at the same time that I collect the assignments. This means that, generally, assignments will not be accepted late.
Although I will collect and grade just a few exercises each week, I encourage you to try as many of the exercises in the textbook as you can find time for. You can only learn mathematics by doing it! During my office hours, I will be happy to answer questions about exercises from the textbook, and I will do some of them as examples in class.
Please note that for all homework exercises, you are required to show your work and explain your reasoning. You should not expect to get much credit for unsupported answers. Please write up your answers carefully, with full English sentences and paragraphs where they are appropriate. Math problems are, among other things, writing assignments, and you should write your answers with the same care that you would give to any other writing assignment.
It's OK for you to work with other people in the class on mathematics problems. However, you should, in the end, write up your own solutions in your own words to be turned in. For programming assignments, you should work on your own unless the assignment tells you to do otherwise.
There will be three in-class tests, which will be given on the following Wednesdays: September 23, October 20, and November 17. The final exam for the course will take place at the time scheduled by the Registrar's office: Thursday, December 16, 7:00 -- 10:00 PM. The final exam will cover material from the entire term, with some emphasis on material that is covered after the third in-class test.
Your numerical grade for the course will be computed as follows:First Test: 15% Second Test: 15% Third Test: 15% Assignments: 35% Final Exam: 20%
I reserve the right to adjust your grade downwards if you miss more than a couple of classes without a good excuse. In my grading scale, an A corresponds to 90--100%, B to 80--89%, C to 65--79%, D to 50--64%, and F to 0--49%. Grades near the endpoints of a range get a plus or minus.
Office Hours, E-mail, and Web
My office is room 313 in Lansing Hall. My office phone extension is 3398. I am on campus most days, and you are welcome to come in anytime you can find me there. My regular office hours, when I am almost certain to be in my office, are:Monday, Wednesday, and Friday: 11:00 -- 12:00 and 1:30 -- 2:30 Tuesday: 12:00 -- 1:00
My e-mail address is email@example.com. E-mail is good way to communicate with me, since I usually answer messages within a day of the time I receive them.
There is a short Web page for this course at http://math.hws.edu/eck/cs229_f10/. I will post weekly readings and assignments on that page.
Here is a tentative weekly schedule of topics for the course:
Dates Topic Sections Aug. 30; Sept. 1, 3 Propositional Logic and Logic Circuits. 1.1,1.2,1.3 Sept. 6, 8, 10 Predicate Logic; Deduction. 1.4,1.5 Sept. 13, 15, 17 Proof; Mathematical Induction. 1.6,1.7,1.8 Sept. 20, 22, 24 Recursion and Induction.
TEST, Wednesday, September 22.
1.9 Sept. 27; 29; Oct. 1 Sets and Operations on Sets. 2.1,2.2,2.3 Oct. 4, 6, 8 Functions; Infinity. 2.4,2.6 Oct. 13, 15 Languages; Regular Expressions
Fall Break, Monday, October 11.
3.1,3.2 Oct. 18, 20, 22 Regular Expressions on the Computer.
TEST, Wednesday, October 20.
3.3 Oct. 25, 27, 29 Finite-state Automata. 3.4,3.5 Nov. 1, 3, 5 Regular and Non-regular Languages. 3.6,3.7 Nov. 8, 10, 12 Context-free Grammars and BNF. 4.1,4.2 Nov. 15, 17, 19 Parsing and Parse Trees.
TEST, Wednesday, November 17.
4.3 Nov. 22 Pushdown Automata.
Thanksgiving Break, November 24 -- 26.
4.4 Nov. 29; Dec. 1, 3 Non-context-free Languages; General Grammars. 4.5,4.6 Dec. 6, 8, 10 Turing Machines and Computability. 5.1,5.2,5.3 Dec. 16 Final Exam: Thursday, December 16, 7:00--10:00 PM