Theory of Computation Course Overview
"Explore computation models, computability, and complexity in the Theory of Computation course taught by Instructor Kai Cai. Delve into finite automata, Turing machines, decidable and undecidable problems, P vs. NP complexity, and the Clay Mathematics Institute's $1M Millennium Prize Problem. Develop math skills in set theory, logic, and proof while earning points through homework assignments. Engage with course materials weekly on the course website, with communication and submissions facilitated through WebClass. Join this intellectually stimulating journey to unravel the mysteries of computation and complexity."
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Theory of Computation Instructor: Kai Cai Period: 2021.10-2022.02
In this course you will learn 1. Computation models Finite automaton Push-down automaton Turing machine 2. Computability Decidable Undecidable 3. Complexity: P and NP
In this course you will learn 1. Computation models Finite automaton e.g. text, numbers, variable names: x=0.1 e.g. parser for compiling programs, natural language processing Push-down automaton = real computer Turing machine
In this course you will learn 2. Computability What problems can be solved, or cannot be solved? e.g. Given a map of JR routes in Osaka, determine if one can go from Sugimotocho to Morinomiya. Decidable e.g. Given a program, determine if it always terminates. Undecidable
In this course you will learn 3. Complexity What problems can be solved fast, or slow? e.g. Given a map of JR routes in Osaka, determine if one can go from Sugimotocho to Morinomiya. P e.g. Given a list of cities and the distances between each pair of cities, find the shortest route that visits each city once and returns to the origin city (travelling salesman problem). NP
In this course you will learn 3. Complexity Clay Mathematics Institute s $1M Millennium Prize Problem : Is P = NP?
Math training In this course you will exercise many maths: Set Logic Proof
Course information Website (slides and videos uploaded weekly): https://www.control.eng.osaka-cu.ac.jp/teaching/compute2021 Grading: 5 homework assignments, each 20 points; submission through Webclass by deadlines Q & A: Basically through WebClass bulletin board ( ) (email: kai.cai@eng.osaka-cu.ac.jp)
