The Theory of Computation Kun-Mao Chao ( 趙坤茂 ) National Taiwan University

Slides:



Advertisements
Similar presentations
CPT S 317: Automata and Formal Languages
Advertisements

Introduction to CS170. CS170 has multiple sections Each section has its own class websites URLs for different sections: Section 000:
1 CS233601: Discrete Mathematics Department of Computer Science National Tsing Hua University.
Fall 2004 WWW IS112 Prof. Dwyer Intro1: Overview and Syllabus Professor Catherine Dwyer.
FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
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 Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture 1 Introduction Jan Maluszynski, IDA, 2007
Administrative Issues ICS 151 Fall 2007 Instructor: Eli Bozorgzadeh.
Fall 2006Costas Busch - RPI1 CSCI-2400 Models of Computation.
Introduction to Formal Languages and Automata
Slide 1 Instructor: Dr. Hong Jiang Teaching Assistant: Mr. Sheng Zhang Department of Computer Science & Engineering University of Nebraska-Lincoln Classroom:
Space-Saving Strategies for Computing Δ-points Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University,
University of Colorado - Dept of Aerospace Engineering Sciences - Introduction to FEM This is ASEN 5007: Introduction to Finite Element Methods.
Calculus I – Course Syllabus Class Periods: 10:00am-10:50am MTWF Classroom: Thompson Hall 303 Instructor: Mei Q. Chen, Thompson Hall 328
Introduction to Operating Systems J. H. Wang Sep. 18, 2012.
CSCI 1301 Principles of Computer Science I
CS 454 Theory of Computation Sonoma State University, Fall 2012 Instructor: B. (Ravi) Ravikumar Office: 116 I Darwin Hall.
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
1 CPRE 388: Embedded Systems II Mobile Platforms Akhilesh Tyagi Fall 2011 Iowa State University.
Introduction to Network Security J. H. Wang Feb. 24, 2011.
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
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
Department of Computer Science and Information Engineering National Taiwan Normal University Multimedia System Design Spring 2012 Mei-Chen Yeh 2011/02/21.
CS 390 Introduction to Theoretical Computer Science.
Introduction to Databases Computer Science 557 September 2007 Instructor: Joe Bockhorst University of Wisconsin - Milwaukee.
MTH 201 Discrete Mathematics Fall Term MTH 201 Discrete Mathematics Fall Term INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION.
F RENCH 1 C OURSE INFORMATION Spring OVERVIEW.
CPSC 121: Models of Computation Unit 0 Introduction George Tsiknis Based on slides by Patrice Belleville and Steve Wolfman.
Introduction to Operating Systems J. H. Wang Sep. 15, 2010.
Computational Structures Tim Sheard & James Hook Portland State University Class Preliminaries.
Computation Theory 主講人:虞台文. Content Overview The Limitation of Computing Complexities Textbooks & Grading.
Algorithms for Biological Sequence Analysis Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University,
Introduction to Information Security J. H. Wang Sep. 18, 2012.
Apple Raises $17 Billion in Record Debt Sale Kun-Mao Chao Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan.
Object Oriented Programming (FIT-II) J. H. Wang Jan. 31, 2008.
CSCE 1030 Computer Science 1 First Day. Course Dr. Ryan Garlick Office: Research Park F201 B –Inside the Computer Science department.
Introduction Welcome to Class! Counseling 120 Counseling 120 College and Career Success.
Course Overview for Compilers J. H. Wang Sep. 20, 2011.
Introduction to Operating Systems J. H. Wang Sep. 13, 2013.
Intro. to Computer Science
CMPT 308 — Computability and Complexity Fall 2004 Instructor: Andrei Bulatov, TA: Ramsay Dyer, Learning.
Why Study Automata? What the Course is About Administrivia 1 Welcome to CSE309.
Introduction to Computer Science Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan ( 台大資訊工程系.
AMS102 Elements in Statistics Prof. Kenny Ye Office: Math Phone: Office Hours: TuTh 3:30-4:30.
MAT 279 Data Communication and the Internet Prof. Shamik Sengupta Office 4210 N Fall 2010.
Course Overview: Linear Algebra
Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan
Telecommunications Networking II Overview and Course Policy.
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).
Formal Languages and Automata Theory
Course Overview - Database Systems
Course Introduction 공학대학원 데이타베이스
Syllabus Introduction to Computer Science
Course Overview - Database Systems
GTECH 709 Criteria for evaluation
ISA 562 Information Security Theory and Practice
The Theory of Computation
Automata and Formal Languages
Administrative Issues
COMP4451 Theory of Computing
Introduction Welcome to Class! Welcome.
The Theory of Computation
Intro. to Computer Science
Intro. to Computer Science
Trees Kun-Mao Chao (趙坤茂)
Trees Kun-Mao Chao (趙坤茂)
Presentation transcript:

The Theory of Computation Kun-Mao Chao ( 趙坤茂 ) National Taiwan University

2 About this course Course: The Theory of Computation ( 限在職生選修 ; This evening class is for part-time students only.) Fall semester, :30 – 21:15 Tuesday, R439 CSIE Building. 3 credits Web site: Instructor: Kun-Mao Chao ( 趙坤茂 ) Teaching assistant: Yen-Wei Wu ( 吳彥緯 )

3 Instructor: Kun-Mao Chao ( 趙坤茂 ) & TA: Yen-Wei Wu ( 吳彥緯 ) Yen-Wei Wu Kun-Mao Chao

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

Grading policy Homework assignments and Class participation (10%) Two midterm exams (70%; 35% each): –Midterm #1: Oct. 28, 2014 (tentative) –Midterm #2: Dec. 9, 2014 (tentative) Oral presentation of selected papers/topics (20%) –Dec. 30, 2014 and Jan. 6,

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

Textbook -- a glance 7

Other matters No class on Dec. 16, 2014 Popular X problems on Dec. 23, 2014 Class presentations on Dec. 30, 2014 and Jan. 6, 2015: TBA 8

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. 9

Top ten reasons for taking this class 5. To improve your programming ability. 4. To explore the pleasure of pressure. 3. To figure out your potential that you never knew. 2. To get inspired. 1. You tell me! 10