day22 - Recursively Enumerable Properties of re Sets Click...

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

View Full Document Right Arrow Icon
Click to edit Master subtitle style 10/4/11 Recursively Enumerable Properties of re Sets
Background image of page 1

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

View Full DocumentRight Arrow Icon
10/4/11 Dec 2, © UCF (Charles E. 22 Definition of re Some texts define re in the same way as I have defined semi-decidable. S k “ is semi-decidable iff there exists a partially computable function g where I prefer the definition of re that says S “ & is re iff S = & or there exists a totally computable function f where S = { y | N x f(x) == y } We will prove these equivalent. ±ctually, f can be a primitive recursive function.
Background image of page 2
10/4/11 Dec 2, © UCF (Charles E. 33 Semi-Decidable Implies re Theorem: Let S be semi-decided by GS. Assume GS is the gS function in our enumeration of effective procedures. If S = Ø then S is re by definition, so we will assume wlog that there is some a ø S. Define the enumerating algorithm FS by FS(<x,t>) = x * STP(x, gs, t ) + a * (1-STP(x, gs, t )) Note: FS is primitive recursive and it enumerates every value in S infinitely often.
Background image of page 3

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

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

Page1 / 11

day22 - Recursively Enumerable Properties of re Sets Click...

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

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