|
|
| Line 1: |
Line 1: |
| In [[computability theory]], a function is called '''limit computable''' if it is the limit of a uniformly computable sequence of functions. The terms '''computable in the limit''' and '''limit recursive''' are also used. One can think of limit computable functions as those admitting an eventually correct computable guessing procedure at their true value. A set is limit computable just when its [[Indicator function|characteristic function]] is limit computable.
| | Nice to meet you, my title is Refugia. To collect cash is what her family members and her appreciate. South Dakota is exactly where me and my spouse live and my family members loves it. For years I've been operating as a payroll clerk.<br><br>Also visit my website :: [http://Animecontent.com/blog/124234 std home test] |
| | |
| If the sequence is uniformly computable relative to ''D'', then the function is '''limit computable in ''D'''''.
| |
| | |
| == Formal definition ==
| |
| | |
| A [[total function]] function <math>r(x)</math> is limit computable if there is a [[total computable function]] <math>\hat{r}(x,s)</math> such that
| |
| : <math>\displaystyle \hat{r} = \lim_{s\to\infty} \hat{r}(x,s)</math>
| |
| | |
| The total function function <math>r(x)</math> is limit computable in ''D'' if there is a total function function <math>\hat{r}(x,s)</math> [[Computable#Relative Computability|computable in ''D'']] also satisfying
| |
| : <math>\displaystyle \hat{r} = \lim_{s\to\infty} \hat{r}(x,s)</math>
| |
| | |
| A set of [[natural number]]s is defined to be computable in the limit if and only if its [[Indicator function|characteristic function]] is computable in the limit. In contrast, the set is [[computable set|computable]] if and only if it is computable in the limit by a function <math>\phi(t,i)</math> and there is a second computable function that takes input ''i'' and returns a value of ''t'' large enough the <math>\phi(t,i)</math> has stabilized.
| |
| | |
| == Limit lemma ==
| |
| | |
| The '''limit lemma''' states that a set of natural numbers is limit computable if and only if the set is computable from <math>0'</math> (the [[Turing jump]] of the empty set). The relativized limit lemma states that a set is limit computable in <math>D</math> if and only if it is computable from <math>D'</math>.
| |
| Moreover, the limit lemma (and its relativization) hold uniformly. Thus one can go from an index for the function <math>\hat{r}(x,s)</math> to an index for <math>\hat{r}(x)</math> relative to <math>0'</math>. One can also go from an index for <math>\hat{r}(x)</math> relative to <math>0'</math> to an index for some <math>\hat{r}(x,s)</math> that has limit <math>\hat{r}(x)</math>.
| |
| | |
| === Proof ===
| |
| As <math>0'</math> is a [computably enumerable] set, it must be computable in the limit itself as the computable function can be defined
| |
| : <math>\displaystyle \hat{r}(x,s)=\begin{cases}
| |
| 1 & \text{if by stage } s, x \text{ has been enumerated into } 0'\\
| |
| 0 & \text{if not}
| |
| \end{cases}</math>
| |
| whose limit <math>r(x)</math> as <math>s</math> goes to infinity is the characteristic function of <math>0'</math>.
| |
| | |
| It therefore suffices to show that if limit computability is preserved by [[Turing reduction]], as this will show that all sets computable from <math>0'</math> are limit computable. Fix sets <math>X,Y</math> which are identified with their characteristic functions and a computable function <math>X_s</math> with limit <math>X</math>. Suppose that <math>Y(z)=\phi^{X}(z)</math> for some Turing reduction <math>\phi</math> and define a computable function <math>Y_s</math> as follows
| |
| | |
| : <math>\displaystyle Y_s(z)=\begin{cases} | |
| \phi^{X_s}(z) & \text{if } \phi^{X_s} \text{ converges in at most } s \text{ steps.}\\
| |
| 0 & \text{otherwise }
| |
| \end{cases} </math>
| |
| Now suppose that the computation <math>\phi^{X}(z)</math> converges in <math>s</math> steps and only looks at the first <math>s</math> bits of <math>X</math>. Now pick <math>s'>s</math> such that for all <math>z < s+1</math> <math>X_{s'}(z)=X(z)</math>. If <math>t > s'</math> then the computation <math>\phi^{X_t}(z)</math> converges in at most <math>s' < t</math> steps to <math>\phi^{X}(z)</math>. Hence <math>Y_s(z)</math> has a limit of <math>\phi^{X}(z)=Y(z)</math>, so <math>Y</math> is limit computable.
| |
| | |
| As the <math>\Delta^0_2</math> sets are just the sets computable from <math>0'</math> by [[Post's theorem]], the limit lemma also entails that the limit computable sets are the <math>\Delta^0_2</math> sets.
| |
| | |
| == Limit computable real numbers ==
| |
| | |
| A [[real number]] ''x'' is '''computable in the limit''' if there is a computable sequence <math>r_i</math> of [[rational numbers]] (or, which is equivalent, [[computable numbers|computable real numbers]]) which converges to ''x''. In contrast, a real number is [[computable]] if and only if there is a sequence of rational numbers which converges to it and which has a computable [[modulus of convergence]].
| |
| | |
| When a real number is viewed as a sequence of bits, the following equivalent definition holds. An infinite sequence <math>\omega</math> of binary digits is computable in the limit if and only if there is a total computable function <math>\phi(t,i)</math> taking values in the set <math>\{0,1\}</math> such that for each ''i'' the limit <math>\lim_{t \rightarrow \infty} \phi(t,i)</math> exists and equals <math>\omega(i)</math>. Thus for each ''i'', as ''t'' increases the value of <math>\phi(t,i)</math> eventually becomes constant and equals <math>\omega(i)</math>. As with the case of computable real numbers, it is not possible to effectively move between the two representations of limit computable reals.
| |
| | |
| == Examples ==
| |
| | |
| * The real whose binary expansion encodes the [[halting problem]] is computable in the limit but not computable.
| |
| * The real whose binary expansion encodes the truth set of [[first-order arithmetic]] is not computable in the limit.
| |
| | |
| == References ==
| |
| | |
| # J. Schmidhuber, "Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit", ''International Journal of Foundations of Computer Science'', 2002.
| |
| # R. Soare. ''Recursively Enumerable Sets and Degrees''. Springer-Verlag 1987.
| |
| | |
| [[Category:Computability theory]]
| |
| [[Category:Theory of computation]]
| |
Nice to meet you, my title is Refugia. To collect cash is what her family members and her appreciate. South Dakota is exactly where me and my spouse live and my family members loves it. For years I've been operating as a payroll clerk.
Also visit my website :: std home test