November 16

November 16 - CSCI 2670 Introduction to Theory of Computing...

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

View Full Document Right Arrow Icon
CSCI 2670 Introduction to Theory of Computing November 16, 2005
Background image of page 1

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

View Full DocumentRight Arrow Icon
November 16, 2005 Agenda Today Section 7.2
Background image of page 2
November 16, 2005 Announcement Homework due next Tuesday (11/22) 7.3 a, 7.4, 7.6 (union only), 7.9, 7.12 1st edition 7.3a, 7.4, 7.6 (union only), 7.10, 7.12
Background image of page 3

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

View Full DocumentRight Arrow Icon
November 16, 2005 Last class Relationship of time complexity for different TM models If a problem can be solved in O(t(n)) time on a multi-tape TM, it can be solved in O(t 2 (n)) time on a single-tape TM If a problem can be solved in O(t(n)) time on a nondeterministic TM, it can be solved in 2 O(t(n)) time on a deterministic TM
Background image of page 4
November 16, 2005 Polynomial vs. exponential time We distinguish between algorithms that have polynomial running time and those that have exponential running time Assume a single tape deterministic TM Polynomial functions – even ones with large exponents – grow less quickly than exponential functions We can only process large data sets with polynomial running time algorithms
Background image of page 5

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

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 14

November 16 - CSCI 2670 Introduction to Theory of Computing...

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

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