recursively enumerabe sets
markvs_at_gmail.com
Date: 03/20/05
- Next message: fcale_at_math.harvard.edu: "A_5 extensions of Q(i)"
- Previous message: Aaron Bergman: "Re: "subtraction" in derived categories"
- Next in thread: Timothy Murphy: "Re: recursively enumerabe sets"
- Reply: Timothy Murphy: "Re: recursively enumerabe sets"
- Reply: Mark Sapir: "Re: recursively enumerabe sets"
- Messages sorted by: [ date ] [ thread ]
Date: 19 Mar 2005 19:15:01 -0500
Let X be a recursively enumerable set of all positive values of a
polynomial f:Z^n-->Z with integer coefficients. For every y in X define
its cost as the minimal ||x|| such that f(x)=y. We say that a real
number r is good if for every y in X
y<r implies cost(y)<r.
Question: Is there a recursively enumerable but non-recursive set such
that the set of good numbers contains arbitrary long intervals?
If the set X is defined using a Turing machine T (instead of a
polynomial), one can define the cost similarly as the length of the
computation accepting y. Then one can ask the same question.
I have a feeling that the answer is "yes", and it should be known. So I
would appreciate any references. Clearly, the set of good numbers
cannot be recursively enumerable because otherwise X would be
recursive.
Mark Sapir
- Next message: fcale_at_math.harvard.edu: "A_5 extensions of Q(i)"
- Previous message: Aaron Bergman: "Re: "subtraction" in derived categories"
- Next in thread: Timothy Murphy: "Re: recursively enumerabe sets"
- Reply: Timothy Murphy: "Re: recursively enumerabe sets"
- Reply: Mark Sapir: "Re: recursively enumerabe sets"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|