Registered: Jun 2006 Posts: 3
if S = Ig, g being a parcial, computable and monotonic function(i.e x < y implies g(x) < g(y) ) is S a recursive set?
__________________ p = np, i got the proof but i lost it
Report this post to a moderator | IP: Logged
Ig: means the image of the function g
Registered: Jun 2006 Posts: 19
For this set S, is it possible for a certain recursive function to explicitly state whether a certain element is in S? If so, S is a recursive set. Maybe see p. 1138 of NKS. -G. Neske
wolframscience.com | wolfram atlas | NKS online | web resources | contact us
Forum Sponsored by Wolfram Research
© 2004-13 Wolfram Research, Inc. | Powered by vBulletin 2.3.0 © 2000-2002 Jelsoft Enterprises, Ltd. | Disclaimer | Archives