CSE 355 is an
introduction to formal language theory and automata; Turing machines, decidability/undecidability, recursive function theory, and introduction to complexity theory.
This class is a first introduction to the theoretical concepts of Computer Science. It covers basic mathematical concepts, the concept of formal languages, and the theoretical machines that recognize them. The class also covers Turing machines and the
problems of decidability and computability.
Depending on the severity of the infraction, penalties may include a grade of zero on the offending item,
a grade of zero on the offending item and a reduction of the final grade by one full letter grade, a failing grade in the course with an indication of academic dishonesty.
Such penalties might result in a requirement to withdraw from the university.
If in doubt about anything related to academic integrity, see the instructor.
Course
Information:CSE 355: Introduction to Theoretical Computer Science
http://www.public.asu.edu/~ccolbou/src/cse355s16.html
Class Meeting Time
T Th 7:30-8:45 a.m.
NEEB 105
Instructor
Office Hours
Charlie Colbourn
Office Brickyard 444
Charles.Colbourn@asu.edu
Thurs 9:00-10:00 a.m., Fri 10:15-11:15 a.m.
TA
Office Hours
Dylan Lusi
Office Centerpoint Tutoring Center 114
dlusi@asu.edu
Recitation Leader
Recitations
Ryan Dougherty
ryan.dougherty@asu.edu
Undergraduate TA
JJ Robertson
jj.robertson@asu.edu
Help Sessions
Contacts
Direct questions as follows:
Prerequisites
Students are expected to have background in Advanced data structures and algorithms (CSE 310), Mathematical foundations (MAT 243).
Special Needs
If you are entitled to extra accommodation for any reason (such
as a disability), we make every reasonable attempt to accommodate you.
However, it is your responsibility to discuss this with the instructor
at the beginning of the course.
Academic Honesty
Work in this course, unless explicitly stated in writing to the contrary, is to be an effort by the individual student. It is not acceptable to use work other than your own without full attribution and acknowledgment. While you are welcome to discuss
problems with others, it is not acceptable to discuss solutions with them.
Protocol for Lecture
Lectures start promptly at 7:30. Announcements will be made, then questions answered, and then the lecture material presented.
Therefore late arrival will mean that (1) you may miss important announcements about homeworks, recitations, readings, and the like;
(2) you may be late submitting a homework and receive no credit for work that you have done; and
(3) you will certainly disrupt the class and make it more difficult for your fellow students to listen and learn.
Please think about your fellow students, and ensure that they have the opportunity to profit from the lecture, whether or not you wish to.
If you must arrive late, enter quietly and do not disrupt the lecture.
If you must leave early, leave quietly and do not disrupt the lecture.
TextBooks:
Required Text
Michael Sipser, Introduction to the Theory of Computation, Third Edition, Cengage Learning, 2012 or 2013.