CSE 355 Spring 2017 
Introduction to Theoretical Computer Science

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.
Course
Information:
CSE 355:  Introduction to Theoretical Computer Science  
http://www.public.asu.edu/~ccolbou/src/cse355s17.html
Class Meeting Time T Th 9:00-10:15 a.m.  
NEEB 105
Instructor 
 
 
Office Hours (start 01/10)
Charlie Colbourn
Office  Brickyard 444 
Charles.Colbourn@asu.edu
Tuesdays 10:30-11:30
Thursdays 1:00-2:00
TA/Recitation Leader 1 
 
 
 
 
Office Hours (start 01/17)
 
 
 
Recitations (start 01/17)
 
 
 
Dylan Lusi
Office  Centerpoint Tutoring Center 114 
dlusi@asu.edu
  • Mondays 12:00 noon - 1:00 p.m.
  • Wednesdays 1:30-2:30 p.m.
  • Fridays 12:00 noon - 1:00 p.m.
  • Tuesdays 12:00-12:50 p.m., BYAC 190
  • Thursdays 12:00-12:50 p.m., BYAC 190
  • Fridays 9:40-10:30 a.m., BYAC 190
  • Fridays 2:00-2:50 p.m., BYAC 190
  • Fridays 3:05-3:55 p.m., BYAC 190
TA/Recitation Leader 2
 
 
 
 
Office Hours (start 01/17)
 
 
 
Recitations (start 01/17)
 
 
 
Ryan Dougherty
Office  Centerpoint Tutoring Center 114 
Ryan.Dougherty@asu.edu
  • Mondays, 11:00 a.m. - 12:00 noon
  • Wednesdays 8:30-9:30 a.m.
  • Mondays 9:40-10:30 a.m., BYAC 190
  • Mondays 2:00-2:50 p.m., BYAC 190
  • Mondays 3:05-3:55 p.m., BYAC 190
  • Wednesdays 9:40-10:30 a.m., BYAC 190
  • Wednesdays 2:00-2:50 p.m., BYAC 190
  • Wednesdays 3:05-3:55 p.m., BYAC 190
Undergraduate TA Larry Standage
Larry.R.Standage@asu.edu
Help Sessions
  • to be scheduled as needed