The Department of Computer Science & Engineering |
CSE/PHI 484/584:
PHILOSOPHY OF COMPUTER SCIENCE Spring 2010 |
http://www.cse.buffalo.edu/~rapaport/584/S10/syl.html
Last Update: 21 April 2010, 11:22
A.M.
Note: or material is highlighted |
Note:
I have adjusted some of the dates and assignments below to reflect what
we actually did in class, rather than on what I had planned or hoped to do :-)
Last drop/add day
Discuss
Term Paper
Position Paper #1 assigned
What is an algorithm? (cont'd):
optional term-paper proposal due
Revision of Position Paper #1 due;
UB student chapter of ACM presents:
Term Paper-proposal revisions due
Ray Turner, CS&EE, U.Essex:
Ray Turner, CS&EE, U.Essex:
Revision of Position Paper #3 due; LAST "R" DATE Peer Editing Day for Position Paper #4
Information about Final Exam
Revision of Position Paper #4 due; Peer Editing Day for Position Paper #5;
Last day to bring in your Reading Journals!
Revision of Position Paper #5 due
"You can lead a horse to water, but you can't make him drink."
— American Proverb
"You can lead a horse to water, but you must convince him it is water
before there is any chance he will drink."
— Albert Goldfain
"Education is not filling a bucket, but lighting a fire"
— William Butler Yeats
"Reading is to the mind what exercise is to the body."
— Sir Richard Steele
Therefore…
"The more you read, the more intelligent you are. It's really that simple."
— Ethan Hawke
But…
"To read critically is to read skeptically.
The reader [should] ask…not only,
‘Do I understand what this means?’
but ‘Do I buy it?’"
— Kenneth S. Goodman
No matter how far
we stray from the tentative schedule, if you do the readings at the
assigned times,
For each item you read, (For suggestions on how to do
this, see the
"Keep a Notebook" section of my
"How to Study" guide on the Web.)
An alternative is to write a 1-paragraph
commentary on each reading: Such commentaries should
not be summaries of the reading.(*)
I will collect these Journals at random times during
the semester and will include them in the grade calculation.
You should include all the Required readings in your Reading Journal;
Grades on the essays will be a function of both your ideas and
how well you defend and express them.
Most, but not necessarily all,
assignments will also be posted to the course website or via UBLearns
email.
You will automatically be placed on the UBLearns email list for the
course.
I will use this email system as my main
means of
communicating with you out of class.
And you can use it to communicate
with the rest of us:
You can also send email just to me, at:
rapaport@buffalo.edu
Be sure to send your mail from your buffalo.edu account
If you send email just to me that I deem to be of general interest,
The emails will be
archived at
http://www.cse.buffalo.edu/~rapaport/584/S10/EMAIL/.
All graded work will receive a letter grade:
Not all work turned in will be graded;
The final exam and the term paper
are optional; you may not do
both, however. The final letter grade will be a
weighted average
of all required work at
either of two levels:
The maximum grade such students can
receive is A– (A-minus) (if all grades on each item are A).
Weights:
The maximum grade such students can
receive is A (if all grades on each item are A).
Weights:
Note that, even if you do all the work at any level,
you might still get a grade lower than indicated above,
I will post more
information on both the mechanics of the position papers (and peer
editing
sessions) and the term paper
later in the
semester.
For further information on my philosophy of grading, see my web document on "How to Grade"
For more information on Incomplete policies, see the Graduate School web page,
"Incomplete Grades".
It is the policy of the CSE department that:
If you have any
problems doing the assignments, consult
Prof. Rapaport. Please be sure to read these webpages:
For some hints on how to avoid
plagiarism when writing essays for courses,
The university's
policies on this topic, both how the instructor should respond and how
students should behave, may be found in the PDF document
(*) The idea and wording for such reading-commentaries
are borrowed from the
assignments for
Stuart M. Shieber's
course
"Can Machines Think".
[Back to text]
PREREQUISITES:
None (except graduate standing for CSE/PHI 584).
But some familiarity
with either computer science or philosophy would be helpful.
STAFF:
Professor:
Dr. William J. Rapaport,
214 Bell Hall,
645-4736,
rapaport@buffalo.edu.
Office Hours:
Tuesdays, 10:00–11:50
A.M.,
and by appointment.
CLASS MEETINGS:
CLASS
INSTR.
REG. #
DAYS
HOURS
LOCN
Lecture
Rapaport
CSE 484: 049223 (4 cr.)
CSE 584: 187617 (3 cr!)
PHI 584: 000828 (4 cr!)MWF
10:00–10:50 A.M.
Clemens 322
TEXTS:
There are no good texts for this course.
Each of the following
recommended texts overlaps to some extent the topics we will
cover.
Most of the assigned readings, however, will be made available
on the Web.
IMPORTANT DATES
& TENTATIVE SCHEDULE:
DAY
MO
DATE
TOPICS
READINGS
M
Jan
11
Introduction.
What is philosophy of computer science?
Readings—What
is philosophy?
W
13
What is philosophy?
Readings—Argument
Analysis & What is CS?
F
15
What is philosophy (cont'd);
Argument Analysis;
M
18
Martin Luther King Day—no class
W
20
What is computer science?
F
22
What is computer science? (cont'd)
Readings—What is
science?
M
25
What is computer science? (summary)
What is science?
Readings—What
is engineering?
W
27
What is science? (cont'd);
What is engineering?
F
29
What is engineering? (cont'd)
What is a computer?
Part Ia: "Engineering" history of computers
Plagiarism quiz assigned.
Readings—What is a
computer? (Part I: History)
M
Feb
1
What is a computer?
W
3
What is a computer? (cont'd)
What is an algorithm?:
Readings—What is an
algorithm?
F
5
Review Plagiarism Quiz
(no new readings)
...but you might find
Rapaport 2010 of interest.
M
8
Peer Editing Day
(i.e., first draft of Position Paper #1 due
—and similarly throughout the rest of the semester)
(no new readings)
W
10
What is an algorithm? (cont'd):
(no new readings)
F
12
What is an algorithm? (cont'd):
(no new readings)
M
15
What is an algorithm? (cont'd):
Position Paper #2 assigned(no new readings)
W
17
What is an algorithm? (cont'd)
(no new readings)
F
19
Turing machines:
Readings—What
is a computer? (Part II: Philosophy)
M
22
Peer Editing Day for Position Paper #2
Term Paper-proposal revisions due
Richard Stallman
"Copyright vs. Community"
6:00 P.M.,
Norton 112.
(no new readings)
W
24
Turing 1936 (cont'd);
(no new readings)
F
26
Turing 1936 (cont'd)
(no new readings)
M
Mar
1
What is a computer?
Revision of Position Paper #2 due;
Position Paper #3 assigned
Readings—What is a
procedure?
W
3
What is a computer? (Searle et al. cont'd)
(no new readings)
F
5
What is a procedure (algorithm, recipe)?
Readings—What is
hypercomputation?
Sa–Su
8–12
Spring Break
M
15
Peer Editing Day for Position Paper #3
(new new readings)
W
17
Hypercomputation
"Specification and Artefact"
2:00 pm, Park 280
Readings—What
is software?
Th
18
Ray Turner, CS&EE, U.Essex:
"Logics of Definitions"
3:30 pm, Park 141
F
19
What is a computer program?
Why is software "soft" & hardware "hard"?
"Semantics and Ontology"
1:00 pm, Wilkeson Quad 144
Readings—Can programs be copyrighted?
M
22
Can computer programs be copyrighted?
Can computer programs be patented?
Position Paper #4 assigned
Readings—What is implementation?
W
24
© vs. patent (cont'd);
What is implementation?
Chalmers,
Rapaport
Readings—Are
computer programs theories?
F
26
Implementation (cont'd);
Readings—Program-world
relationship
M
29
(no new readings)
W
31
Implementation (cont'd);
Omitted:
Are computer programs theories?
Optional Readings—Can
programs be verified?
F
Apr
2
What is the program-world relationship? (Smith)
and reading journals
Readings—Computer
ethics (Part I)
M
5
Computer Ethics (I):
Should we trust decisions made by computers? (Moor 1979)
Position Paper #5 assigned;
Start bringing in your Reading Journals :-)
Readings—Philosophy of AI
W
7
Philosophy of AI:
The Turing test & the Chinese-Room Argument
(no new readings)
F
9
Philosophy of AI: TT & CRA (cont'd)
(no new readings)
M
12
Don't forget your reading journals!
(no new readings)
W
14
Philosophy of AI: TT & CRA (cont'd)
Readings—Computer ethics (II)
F
16
Philosophy of AI: TT & CRA (cont'd)
(no new readings)
M
19
Computer Ethics (II):
Is it moral to build an AI?
(no new readings)
W
21
Is it moral to build an AI? (cont'd)
Readings—Philosophy of CS
Th
22
CSE Distinguished Speaker:
Maria Klawe
"Gender and Computing"
3:30–4:30 P.M.
120 Clemens
F
23
Smith 2002
(no new readings)
M
26
Last Class:
Summary & review
(no new readings)
T–W
26–27
Reading Days
(no new readings)
M
May
3
Optional final exam
(8–11 A.M.;
NSC 218)
XOR
optional term paper due;
AND
optional revised position paper due
READING:
"Teachers open the door, but you must enter by yourself."
— Chinese Proverb
Consequently, in lectures, I will only be able to
skim the surface of the issues.
But I will assign a lot of reading,
which I will expect you all to do.
you will be able to finish everything by the end of the
semester.
Reading Journal:
To help you keep track of your reading and the ideas you have while
reading, it will be useful for
you to keep a "Reading Journal", because:
you may
include any Strongly Recommended or Recommended readings, too.
HOW TO READ and HOW TO STUDY:
see
"How to Read (a Computer Science Text)".
After reading each sentence
and before reading the next, ask yourself "Why?".
If you can't
answer
that question, then ask for help.
ATTENDANCE, HOMEWORKS, ASSIGNMENTS, EXAMS, UBLearns:
You will have an
opportunity to revise some (but not all) of these.
Therefore,
be
sure to get a classmate's phone number or email address
(for instance, 1
or 2
people sitting next to you in class, whoever they are!)
so that you will not miss
assignments in the unlikely event that you miss a class.
IF you do not normally read email at the email address that
UB
has as your official address,
THEN please either do so for this course,
ELSE have your mail forwarded.
You may send questions and comments
that are of general interest to the entire class using the UBlearns
email list.
and
include
"CSE 584" in the Subject line
so that my mailer doesn't think it's spam.
I will
remail it to the email list along with my reply,
but you will remain anonymous.
GRADING:
Undergrads (in 484) and
grads (in 584)
will be graded on different
bases.
'A', 'A–',
'B+', 'B', 'B–', 'C+', 'C', 'C–' (484 only), 'D+' (484 only),
'D', or 'F'
however, all work
turned in will be recorded.
Missing work (and missing class) will
tend to lower your grade.
attendance/participation + Reading Journal 50% position papers 50%
attendance/participation + Reading Journal 50% position papers 25% final exam XOR term paper 25%
if, for
instance, you did not attend all lectures, or if your letter
grade for the papers or exam is less than A, etc.
Incompletes:
It is University policy that a grade of Incomplete
is to be given only when a small amount of work or a single exam is
missed due to circumstances beyond the student's control, and that
student is otherwise doing passing work. I will follow this policy
strictly! Thus, you should assume that I will not give
incompletes :-)
Any incompletes that I might give, in a lapse of judgment :-),
will have to be made up by the end of the
Fall 2010
ACADEMIC INTEGRITY:
Although it is acceptable to discuss general
approaches with your fellow students,
the work you turn in must be your
own.
which spell out all the
details of this, and related, policies.
see my website
"Plagiarism".
CLASSROOM DISRUPTIONS:
In large classes (but surely not ours :-), students have been known to be
disruptive,
either to the instructor or to fellow students.
"Obstruction or Disruption in the Classroom".
Copyright © 2010 by
William J. Rapaport
(rapaport@buffalo.edu)
http://www.cse.buffalo.edu/~rapaport/584/S10/syl.html-20100421-2