1 Module 1: Course Overview Course: CSE 460 Instructor: Dr. Eric Torng Grader/TA: To Be Determined.

Slides:



Advertisements
Similar presentations
Applied Computer Science II Chapter 4: Decidability Prof. Dr. Luc De Raedt Institut für Informatik Albert-Ludwigs Universität Freiburg Germany.
Advertisements

Formal Languages: main findings so far A problem can be formalised as a formal language A formal language can be defined in various ways, e.g.: the language.
CSE 202 – Formal Languages and Automata Theory 1 REGULAR LANGUAGE.
Recap CS605: The Mathematics and Theory of Computer Science.
CS355 – The Mathematics and Theory of Computer Science Reductions.
Computability and Complexity 5-1 Classifying Problems Computability and Complexity Andrei Bulatov.
1 Lecture 4 Topics –Problem solving Subroutine Theme –REC language class The class of solvable problems Closure properties.
1 Module 2: Fundamental Concepts Problems Programs –Programming languages.
Applied Computer Science II Chapter 2 : Context-free languages Prof. Dr. Luc De Raedt Institut für Informatik Albert-Ludwigs Universität Freiburg Germany.
Lecture 2: Fundamental Concepts
1 Module 2: Fundamental Concepts Problems Programs –Programming languages.
1 Lecture 1: Course Overview Course: CSE 360 Instructor: Dr. Eric Torng TA: Huamin Chen.
UMass Lowell Computer Science Foundations of Computer Science Prof. Karen Daniels Fall, 2009 Lecture 1 Introduction/Overview Th. 9/3/2009.
COMS W1004 Introduction to Computer Science May 28, 2008.
CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture 1 Introduction Jan Maluszynski, IDA, 2007
1 Lecture 2 Topics –Importance of this material Fundamental Limitations –Connecting Problems and Languages Problems –Search, function and decision problems.
LING 388: Language and Computers Sandiway Fong Lecture 28: 12/5.
1 Decidability continued. 2 Undecidable Problems Halting Problem: Does machine halt on input ? State-entry Problem: Does machine enter state halt on input.
Introduction to Programming with Java, for Beginners Welcome.
1 Lecture 11 Studying structure of REC –Complexity theory overview –Automata theory preview Motivating Problem –string searching.
1 Lecture 14 Studying the internal structure of REC, the set of solvable problems –Complexity theory overview –Automata theory preview Motivating Problem.
Final Exam Review Cummulative Chapters 0, 1, 2, 3, 4, 5 and 7.
By: Er. Sukhwinder kaur.  Computation Computation  Algorithm Algorithm  Objectives Objectives  What do we study in Theory of Computation ? What do.
CS 454 Theory of Computation Sonoma State University, Fall 2012 Instructor: B. (Ravi) Ravikumar Office: 116 I Darwin Hall.
1 Theory of Computation 計算理論 2 Instructor: 顏嗣鈞 Web: Time: 9:10-12:10 PM, Monday Place: BL 103.
Lei Bu Preliminary Introduction to the Theory of Computation.
LING 388: Language and Computers Sandiway Fong Lecture 30 12/8.
CS355 – Theory of Computation Dr. Aidan Mooney, September 2006 National University of Ireland, Maynooth Department of Computer Science.
Welcome to Honors Intro to CS Theory Introduction to CS Theory (Honors & Traditional): - formalization of computation - various models of computation (increasing.
CS 390 Introduction to Theoretical Computer Science.
Automata, Computability, and Complexity Lecture 1 Section 0.1 Wed, Aug 22, 2007.
Exact string matching Rhys Price Jones Anne Haake Week 2: Bioinformatics Computing I continued.
By: Er. Sukhwinder kaur.  What is Automata Theory? What is Automata Theory?  Alphabet and Strings Alphabet and Strings  Empty String Empty String 
Relationships Between Structures “→” ≝ “Can be defined in terms of” Programs Groups Proofs Trees Complex numbers Operators Propositions Graphs Real.
1 INFO 2950 Prof. Carla Gomes Module Modeling Computation: Language Recognition Rosen, Chapter 12.4.
Welcome to Honors Intro to CS Theory Introduction to CS Theory (Honors & Traditional): - formalization of computation - various models of computation (increasing.
Overview.  Explores the theoretical foundations of computing  What can and cannot be done by an algorithm  Most of the material predates computers!
Saeid Pashzadeh Jan 2009 Theory of Computation 1.
1 Theory of Computation 計算理論 2 Instructor: 顏嗣鈞 Web: Time: 9:10-12:10 PM, Monday Place: BL.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
CST229 Week 8 Questions or concerns? Hand back Homework #6 & #5 Reading: Chapter 14 Comment about Lab1 Getting started with Lab2 Chapter 14 – Regular Grammar.
CS130: Theory of Computation An introductory course on the theory of automata and formal languages: models of machines, languages and grammars, relationship.
CSCI 2670 Introduction to Theory of Computing October 13, 2005.
Why Study Automata? What the Course is About Administrivia 1 Welcome to CSE309.
1 Course Overview Why this course “formal languages and automata theory?” What do computers really do? What are the practical benefits/application of formal.
1 CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 12 Mälardalen University 2007.
C Sc 132 Computing Theory Professor Meiliu Lu Computer Science Department.
CSE 202 – Formal Languages and Automata Theory 1 REGULAR EXPRESSION.
CSE 311 Foundations of Computing I Lecture 19 Recursive Definitions: Context-Free Grammars and Languages Spring
CSE 311 Foundations of Computing I Lecture 19 Recursive Definitions: Context-Free Grammars and Languages Autumn 2012 CSE
CS 154 Formal Languages and Computability March 17 Class Meeting Department of Computer Science San Jose State University Spring 2016 Instructor: Ron Mak.
CSE 311 Foundations of Computing I Lecture 18 Recursive Definitions: Context-Free Grammars and Languages Autumn 2011 CSE 3111.
CSE 311 Foundations of Computing I Lecture 20 Context-Free Grammars and Languages Autumn 2012 CSE
CS 154 Formal Languages and Computability May 12 Class Meeting Department of Computer Science San Jose State University Spring 2016 Instructor: Ron Mak.
TCCICOMPUTERCO ACHING.COM Diploma Programming Course In Ahmedabad.
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).
Theory of Computation. Introduction We study this course in order to answer the following questions: What are the fundamental capabilities and limitations.
Electrical Engineering
Why Study Automata Theory and Formal Languages?
Formal Foundations-II [Theory of Automata]
Welcome to Automata Theory Course
Why Study Automata? What the Course is About Administrivia
Types for Programs and Proofs
Context-free grammars, derivation trees, and ambiguity
Welcome to Automata Theory Course
Formal Language & Automata Theory
Foundations of Computer Science
Teori Bahasa dan Automata Lecture 1: Course Overview and Introduction
Teori Bahasa dan Automata Lecture 1: Course Overview and Introduction
Presentation transcript:

1 Module 1: Course Overview Course: CSE 460 Instructor: Dr. Eric Torng Grader/TA: To Be Determined

2 What is this course? Philosophy of computing course –We take a step back to think about computing in broader terms Science of computing course –We study fundamental ideas/results that shape the field of computer science “Applied” computing course –We learn study a broad range of material with relevance to computing today

3 Philosophy Phil. of life –What is the purpose of life? –What are we capable of accomplishing in life? –Are there limits to what we can do in life? –Why do we drive on parkways and park on driveways? Phil. of computing –What is the purpose of programming? –What can we achieve through programming? –Are there limits to what we can do with programs? –Why don’t debuggers actually debug programs?

4 Science Physics –Study of fundamental physical laws and phenomenon like gravity and electricity Engineering –Governed by physical laws Our material –Study of fundamental computational laws and phenomenon like undecidability and universal computers Programming –Governed by computational laws

5 Applied computing Applications are not immediately obvious –In some cases, seeing the applicability of this material requires advanced abstraction skills Every year, there are people who leave this course unable to see the applicability of the material –Others require more material in order to completely understand their application for example, to understand how regular expressions and context-free grammars are applied to the design of compilers, you need to take a compilers course

6 Some applications –Important programming languages regular expressions (perl) finite state automata (used in hardware design) context-free grammars –Proofs of program correctness –Subroutines Using them to prove problems are unsolvable –String searching/Pattern matching –Algorithm design concepts such as recursion

7 Fundamental Theme * What are the capabilities and limitations of computers and computer programs? –What can we do with computers/programs? –Are there things we cannot do with computers/programs?