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

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.

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.

CSC 171 – FALL 2004 COMPUTER PROGRAMMING LECTURE 0 ADMINISTRATION.

Administrative Issues ICS 151 Fall 2007 Instructor: Eli Bozorgzadeh.

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.

Slide 1 Instructor: Dr. Hong Jiang Teaching Assistant: Mr. Sheng Zhang Department of Computer Science & Engineering University of Nebraska-Lincoln Classroom:

INSTRUCTOR: DR. XENIA MOUNTROUIDOU CS CS Artificial Intelligence.

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

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.

CS 390 Introduction to Theoretical Computer Science.

CSC 171 – FALL 2001 COMPUTER PROGRAMMING LECTURE 0 ADMINISTRATION.

MTH 201 Discrete Mathematics Fall Term MTH 201 Discrete Mathematics Fall Term INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION.

Ministry of Higher Education Sohar College of Applied Sciences IT department Comp Introduction to Programming Using C++ Fall, 2011.

Saeid Pashzadeh Jan 2009 Theory of Computation 1.

Computational Structures Tim Sheard & James Hook Portland State University Class Preliminaries.

Introduction to Computer Programming (FIT-I pro) J. H. Wang Sep. 17, 2007.

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.

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.

Intro. to Computer Science

CMPT 308 — Computability and Complexity Fall 2004 Instructor: Andrei Bulatov, TA: Ramsay Dyer, Learning.

Introduction to Computer Science Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan ( 台大資訊工程系.

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

MAT 279 Data Communication and the Internet Prof. Shamik Sengupta Office 4210 N Fall 2010.

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

Introduction to Artificial Intelligence Heshaam Faili University of Tehran.

Formal Languages and Automata Theory

APPLIED MANAGEMENT SCIENCE IN AGRICULTURAL SYSTEMS I

CSE 489/589 Modern Networking Concepts

Introduction to Operating Systems

Course Overview - Database Systems

Calculus I – Course Syllabus

CPT S 317: Automata and Formal Languages

Syllabus Introduction to Computer Science

COMP 283 Discrete Structures

Computer Networks CNT5106C

CS-300 Theory of Computation 2nd Sem 2017 Lecture 1.

Course Information CSE 3213 – Fall 2011.

CSC215 Lecture Orientation.

CSE 5344 Fall 2016 COMPUTER NETWORKS

Intro. to Computer Science

ISA 562 Information Security Theory and Practice

The Largest Known Prime Number

Accelerated Introduction to Computer Science

The Theory of Computation

Automata and Formal Languages

26 July 2011 SC 611 Class 1.

COMP4451 Theory of Computing

CPT S 317: Automata and Formal Languages

Facebook’s WhatsApp Purchase

Administrative Issues

Intro. to Computer Science

Intro. to Computer Science

Trees Kun-Mao Chao (趙坤茂)

Trees Kun-Mao Chao (趙坤茂)

CS Computer Science II: Data Structures and Abstraction Fall 2009

Introduction to Probability

Introduction to Probability

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, 2013 18:30 – 21:15 Tuesday, R439 CSIE Building. 3 credits Web site: http://www.csie.ntu.edu.tw/~kmchao/theory13fall Instructor: Kun-Mao Chao (趙坤茂) Teaching assistant: Chia-Jung Chang (張家榮)

Instructor: Kun-Mao Chao (趙坤茂) & TA: 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 (10%) Two midterm exams (70%; 35% each): Midterm #1: Oct. 29, 2013 (tentative) Midterm #2: Dec. 10, 2013 (tentative) Oral presentation of selected papers/topics (20%) Dec. 31, 2013

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

Other matters No class on Dec. 17, 2013 Fixed-Parameter Algorithms & Boolean Networks on Dec. 24, 2013 Class presentations on Dec. 31, 2013: TBA

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 explore the pleasure of pressure. 3. To figure out your potential that you never knew. 2. To get inspired. 1. You tell me!