August 18

August 18 - CSCI 2670 Introduction to Theory of Computing...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the 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 e-mail 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 k-tuple Set notation...
View Full Document

{[ snackBarMessage ]}

Page1 / 17

August 18 - CSCI 2670 Introduction to Theory of Computing...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online