The Theory of Computation

Slides:



Advertisements
Similar presentations
Introduction to CS170. CS170 has multiple sections Each section has its own class websites URLs for different sections: Section 000:
Advertisements

Fall 2004 WWW IS112 Prof. Dwyer Intro1: Overview and Syllabus Professor Catherine Dwyer.
Fall 2005Costas Busch - RPI1 CSCI-2400 Models of Computation.
UMass Lowell Computer Science Foundations of Computer Science Prof. Karen Daniels Fall, 2009 Lecture 1 Introduction/Overview Th. 9/3/2009.
CS : Artificial Intelligence: Representation and Problem Solving Fall 2002 Prof. Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Introduction to Formal Languages and Automata
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
Calculus I – Course Syllabus Class Periods: 10:00am-10:50am MTWF Classroom: Thompson Hall 303 Instructor: Mei Q. Chen, Thompson Hall 328
WELCOME PARENTS! Honors Computer Programming Ms. L. Dutchen.
COMP 111 Programming Languages 1 First Day. Course COMP111 Dr. Abdul-Hameed Assawadi Office: Room AS15 – No. 2 Tel: Ext. ??
CS 103 Discrete Structures Lecture 01 Introduction to the Course
BIOLOGY CP What topics will we be covering in this course?
CSS 404 Internet Concepts. XP Objectives Developing a Web page and a Website Working with CSS (Cascading Style Sheets) Web Tables Web Forms Multimedia.
Course Introduction Software Engineering
CS 390 Introduction to Theoretical Computer Science.
© M. Winter COSC/MATH 4P61 - Theory of Computation COSC/MATH 4P61 Theory of Computation Michael Winter –office: J323 –office hours: Mon & Fri, 10:00am-noon.
Welcome CSCI 1100/1202 Intro to Computer Science Winter 2002.
Welcome!! CIT 593 Intro to Computer Systems aka “Introduction to Computer Architecture” Fall 2012.
MTH 201 Discrete Mathematics Fall Term MTH 201 Discrete Mathematics Fall Term INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION.
Econ 3320 Managerial Economics (Fall 2015)
Saeid Pashzadeh Jan 2009 Theory of Computation 1.
Computational Structures Tim Sheard & James Hook Portland State University Class Preliminaries.
Computation Theory 主講人:虞台文. Content Overview The Limitation of Computing Complexities Textbooks & Grading.
Introduction Welcome to Class! Counseling 120 Counseling 120 College and Career Success.
Introduction Welcome to Class! Counseling 120 Counseling 120 College and Career Success.
ELEC 1009E-1B02 Introduction to Computer Science 計算機概論 2011 Fall.
The Theory of Computation Kun-Mao Chao ( 趙坤茂 ) National Taiwan University
Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan
Telecommunications Networking II Overview and Course Policy.
CIS 505: Programming- Language Paradigms Torben Amtoft Xinming (Simon) Ou Aug 23, 2010.
Computation Theory Asia Mahdi. Textbooks Programs, Machines and Computation: An Introduction to the Theory of Computing - Authors: Keith Clark and Don.
Theory of Computation. Introduction to The Course Lectures: Room ( Sun. & Tue.: 8 am – 9:30 am) Instructor: Dr. Ayman Srour (Ph.D. in Computer Science).
Gachon University has a strict grading policy. LESS than 25% of students can get an A LESS than 40% of students can get a B Everyone else must get a C.
Data Structures Dr. Abd El-Aziz Ahmed Assistant Professor Institute of Statistical Studies and Research, Cairo University Springer 2015 DS.
Formal Languages and Automata Theory
APPLIED MANAGEMENT SCIENCE IN AGRICULTURAL SYSTEMS I
Course Overview - Database Systems
Course Overview CS 4501 / 6501 Software Testing
Calculus I – Course Syllabus
CPT S 317: Automata and Formal Languages
Course Introduction 공학대학원 데이타베이스
Syllabus Introduction to Computer Science
CS-300 Theory of Computation 2nd Sem 2017 Lecture 1.
Course Information CSE 3213 – Fall 2011.
Computer Architecture Syllabus
CSC215 Lecture Orientation.
Course Overview - Database Systems
Andy Wang Operating Systems COP 4610 / CGS 5765
Lecture 0 Course Information
GTECH 709 Criteria for evaluation
CSC215 Lecture Orientation.
Introduction Welcome to Class! Welcome.
Andy Wang Operating Systems COP 4610 / CGS 5765
WELCOME TO BIOLOGY.
Andy Wang Operating Systems COP 4610 / CGS 5765
ELT & Vocabulary Learning
Accelerated Introduction to Computer Science
Automata and Formal Languages
26 July 2011 SC 611 Class 1.
Welcome to College English 2!
CSC215 Lecture Orientation.
COMP4451 Theory of Computing
CPT S 317: Automata and Formal Languages
Introduction Welcome to Class! Welcome.
The Theory of Computation
Trees Kun-Mao Chao (趙坤茂)
Andy Wang Operating Systems COP 4610 / CGS 5765
Trees Kun-Mao Chao (趙坤茂)
CS Computer Science II: Data Structures and Abstraction Fall 2009
Welcome to College English 2!
Presentation transcript:

The Theory of Computation Kun-Mao Chao (趙坤茂) National Taiwan University http://www.csie.ntu.edu.tw/~kmchao/

About this course Course: The Theory of Computation (限在職專班生選修; This evening class is for part-time students of 在職專班 only.) Fall semester, 2012 18:30 - 21:15 Tuesday, R439 CSIE Building. 3 credits Web site: http://www.csie.ntu.edu.tw/~kmchao/theory12fall Instructor: Kun-Mao Chao (趙坤茂) Teaching assistant: Chia-Jung Chang (張家榮)

Topics Sets, Relations, Languages Finite Automata Context-free Languages Turing Machines Undecidability Computational Complexity NP-completeness Related Topics

Grading policy Homework assignments and Class participation (15%) Two midterm exams (70%; 35% each): Midterm #1: Oct. 30, 2012 (tentative) Midterm #2: Dec. 11, 2012 (tentative) Oral presentation of selected papers/topics (15%)

Textbook Elements of the Theory of Computation, Second Edition by Harry R. Lewis and Christos H. Papadimitriou, Prentice-Hall, 1998.

ISAAC 2012 The 23rd International Symposium on Algorithms and Computation (ISAAC 2012) will be held at NTU on Dec. 19-21. Please attend the reception in the evening of Dec. 18.

Top ten reasons for taking this class 10. You may bring your dinner to the class as long as it is not stinky and you clean up your table afterwards. 9. A good mental exercise. 8. To learn more about theoretical computer science. 7. To sharpen your skills in proving theorems. 6. To learn more about computation.

Top ten reasons for taking this class 5. To improve your programming ability. 4. To participate in an international event. 3. To figure out your potential that you never knew. 2. To get inspired. 1. You tell me!

Tonight’s outlook Let’s go for a walk – a nice way to have insight into challenging problems. In tonight’s walk, we discussed the question “How many ways can one partition a set of n elements?” Here is the answer. (Bell number) Here is a note that I wrote next morning.