CSE 355 Spring 2018 
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/cse355s18.html
Class Meeting Time T Th 9:00-10:15 a.m.  
CAVC 351
Instructor 
 
 
Office Hours (start 01/08)
Charlie Colbourn
Office  Brickyard 444 
Charles.Colbourn@asu.edu
Monday 8:00-9:00
Thursdays 1:00-2:00
TA/Recitation Leader 1 
 
Office Hours (start week of 01/15)
 
 
Recitations (start week of 01/15)
 
Sumitava Ghosh
Office  BYENG 498 
sghosh56@asu.edu
  • Mondays 11:00-12:00
  • Tuesdays 11:00-12:00
  • Monday 9:40-10:30, BYAC 260
  • Wednesday 9:40-10:30, BYAC 260
TA/Recitation Leader 2
 
Office Hours (start 01/15)
 
Recitations (start 01/15)
 
Ryan Dougherty
Office  Brickyard 221 
Ryan.Dougherty@asu.edu
  • Wednesday 11:00-12:00
  • Friday 8:15-9:15 a.m.
  • Friday 9:40-10:30 a.m., BYAC 260