November 17

# November 17 - CSCI 2670 Introduction to Theory of Computing...

This preview shows pages 1–8. Sign up to view the full content.

CSCI 2670 Introduction to Theory of Computing November 17, 2005

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

View Full Document
November 17, 2005 Agenda Today Finish Section 7.2 Start Section 7.3
November 17, 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

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

View Full Document
November 17, 2005 Last class Introduced the class P P = U k TIME(n k ) Proved two languages are in P Binary tree query PATH
November 17, 2005 Another problem in P RELPRIME = {<x,y> | x and y are relatively prime} RELPRIME P How can we show this? We cannot find prime factorization of x and y and compare Use Euclidean algorithm for finding gcd(x,y) <x,y> RELPRIME iff gcd(x,y) = 1

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

View Full Document
November 17, 2005 Euclidean algorithm E = “On input <x,y>, where x and y are natural numbers in binary: 1. Repeat until y = 0 1. Assign x x mod y 2. Exchange x and y 2. Output x”
Solution to RELPRIME R = “On input <x,y>, where x and y are natural numbers in binary: 1. Run E on <x,y> 2. If result is 1, accept 3. Else reject

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

View Full Document
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 / 18

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

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

View Full Document
Ask a homework question - tutors are online