This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSCI 2670 Introduction to Theory of Computing Instructor: Shelby Funk Today • Syllabus • Chapter 0 • Homework due Tuesday, August 23 – Read pages Chapter 0 • You are responsible for all this material even if I don’t cover it in class – Send me an email telling me your favorite thing about Athens • If you’re new to Athens, tell me your favorite thing about your most recent hometown Course goals • Theoretically explore the capabilities and limitations of computers – Complexity theory • What makes some problems computationally hard and others easy? – Computability theory • What problems can be solved by a computer? – Automata theory • How can we mathematically model computation? Sets, multisets and sequences • Set – Order and repetition don’t matter • {7,4,7,3} = {3,4,7} • Multiset – Order doesn’t matter, repetition does • {7,4,7,3} = {3,4,7,7} ≠ {3,4,7} • Sequence – Order and repetition matter • (7,4,7,3) ≠ (3,4,7,7) • Finite sequence of k elements may be called a ktuple Set notation...
View
Full
Document
This note was uploaded on 02/07/2011 for the course CS 501 taught by Professor Sm during the Spring '11 term at Indiana.
 Spring '11
 sm

Click to edit the document details