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
CSCI 2670 Introduction to Theory of Computing Instructor: Shelby Funk
Background image of page 1

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

View Full DocumentRight Arrow Icon
Today •Sy l labu s • 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
Background image of page 2
Course goals • Theoretically explore the capabilities and limitations of computers –Comp lex ity theory • What makes some problems computationally hard and others easy? – Computability theory • What problems can be solved by a computer?
Background image of page 3

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

View Full DocumentRight Arrow Icon
Sets, multisets and sequences •Set – Order and repetition don’t matter • {7,4,7,3} = {3,4,7} •Mu lt iset – 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)
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the 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.

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