|
|
| Line 1: |
Line 1: |
| {{lowercase|title=μ-recursive function}}
| | Lessie Essex is what people call me and Adore it. Her husband and her chose to reside Massachusetts but her husband wants your crooks to move. One of her favorite hobbies is doing origami but she is struggling in order to locate time so as. Administering databases been recently my employment for quite a while and I'm doing beneficial financially. My husband and I maintain a site. You might want to give it a try here: http://www.rottentomatoes.com/user/1083060/blogs/?id=793517<br><br>Also visit my webpage :: [http://www.rottentomatoes.com/user/1083060/blogs/?id=793517 pc suite free download] |
| In [[mathematical logic]] and [[computer science]], the '''μ-recursive functions''' are a class of [[partial function]]s from [[natural number]]s to [[natural number]]s which are "computable" in an intuitive sense. In fact, in [[Computability theory (computation)|computability theory]] it is shown that the μ-recursive functions are precisely the functions that can be computed by [[Turing machine]]s. The μ-recursive functions are closely related to [[primitive recursive function]]s, and their inductive definition (below) builds upon that of the primitive recursive functions. However, not every μ-recursive function is a primitive recursive function—the most famous example is the [[Ackermann function]].
| |
| | |
| Other equivalent classes of functions are the [[lambda-recursive function|λ-recursive functions]] and the functions that can be computed by [[Markov algorithm]]s.
| |
| | |
| The set of all recursive functions is known as [[R (complexity)|R]] in [[computational complexity theory]].
| |
| | |
| ==Definition==
| |
| | |
| The '''μ-recursive functions''' (or '''partial μ-recursive functions''') are partial functions that take finite tuples of natural numbers and return a single natural number. They are the smallest class of partial functions that includes the initial functions and is closed under composition, primitive recursion, and the [[μ operator]].
| |
| | |
| The smallest class of functions including the initial functions and closed under composition and primitive recursion (i.e. without minimisation) is the class of [[primitive recursive functions]]. While all primitive recursive functions are total, this is not true of partial recursive functions; for example, the minimisation of the successor function is undefined. The primitive recursive functions are a subset of the total recursive functions, which are a subset of the partial recursive functions. For example, the [[Ackermann function]] can be proven to be total recursive, but not primitive.
| |
| | |
| Initial or "basic" functions: (In the following the subscripting is per Kleene (1952) p. 219. For more about some of the various symbolisms found in the literature see [[#Symbolism|Symbolism]] below.)
| |
| | |
| #'''Constant function''': For each natural number <math>n\,</math> and every <math>k\,</math>:
| |
| #:<math>f(x_1,\ldots,x_k) = n\,</math>.
| |
| #:Alternative definitions use compositions of the successor function and use a '''zero function''', that always returns zero, in place of the constant function.
| |
| # '''Successor function S:'''
| |
| #: <math>S(x) \stackrel{\mathrm{def}}{=} f(x) = x + 1\,</math>
| |
| # '''Projection function''' <math>P_i^k</math> (also called the '''Identity function''' <math>I_i^k</math>): For all natural numbers <math>i, k\,</math> such that <math>1 \le i \le k</math>:
| |
| #: <math>P_i^k \stackrel{\mathrm{def}}{=} f(x_1,\ldots,x_k) = x_i</math>.
| |
| | |
| Operators:
| |
| | |
| # '''Composition operator''' <math>\circ\,</math> (also called the '''substitution operator'''): Given an m-ary function <math>h(x_1,\ldots,x_m)\,</math> and m k-ary functions <math>g_1(x_1,\ldots,x_k),\ldots,g_m(x_1,\ldots, x_k)</math>:
| |
| #:<math>h \circ (g_1, \ldots, g_m) \stackrel{\mathrm{def}}{=} f(x_1,\ldots,x_k) = h(g_1(x_1,\ldots,x_k),\ldots,g_m(x_1,\ldots,x_k))\,</math>.
| |
| # '''Primitive recursion operator''' <math>\rho\,</math>: Given the k-ary function <math>g(x_1,\ldots,x_k)\,</math> and k+2 -ary function <math>h(y,z,x_1,\ldots,x_k)\,</math>:
| |
| #: <math>\begin{align}
| |
| \rho(g, h) &\stackrel{\mathrm{def}}{=} f(y, x_1,\ldots, x_k) \quad {\rm where} \\
| |
| f(0,x_1,\ldots,x_k) &= g(x_1,\ldots,x_k) \\
| |
| f(y+1,x_1,\ldots,x_k) &= h(y,f(y,x_1,\ldots,x_k),x_1,\ldots,x_k)\,\end{align}</math>.
| |
| #'''Minimisation operator''' <math>\mu\,</math>: Given a (k+1)-ary total function <math>f(y, x_1, \ldots, x_k)\,</math>:
| |
| #:<math>\begin{align}
| |
| \mu(f)(x_1, \ldots, x_k) = z \stackrel{\mathrm{def}}{\iff}\ f(z, x_1, \ldots, x_k)&=0\quad \text{and}\\
| |
| f(i, x_1, \ldots, x_k)&>0 \quad \text{for}\ i=0, \ldots, z-1.
| |
| \end{align}</math>
| |
| #:Intuitively, minimisation seeks--beginning the search from 0 and proceeding upwards--the smallest argument that causes the function to return zero; if there is no such argument, the search never terminates.
| |
| | |
| The '''strong equality''' operator <math>\simeq</math> can be used to compare partial μ-recursive functions. This is defined for all partial functions ''f'' and ''g'' so that
| |
| :<math>f(x_1,\ldots,x_k) \simeq g(x_1,\ldots,x_l)</math>
| |
| holds if and only if for any choice of arguments either both functions are defined and their values are equal or both functions are undefined.
| |
| | |
| == Equivalence with other models of computability ==
| |
| | |
| {{Expand section|date=February 2010}}
| |
| | |
| In the [[Church's thesis|equivalence of models of computability]], a parallel is drawn between [[Turing machine]]s which do not terminate for certain inputs and an undefined result for that input in the corresponding partial recursive function.
| |
| The unbounded search operator is not definable by the rules of primitive recursion as those do not provide a mechanism for "infinite loops" (undefined values).
| |
| | |
| == Normal form theorem ==
| |
| | |
| A [[Kleene's T predicate#Normal form theorem|normal form theorem]] due to Kleene says that for each ''k'' there are primitive recursive functions <math>U(y)\!</math> and <math>T(y,e,x_1,\ldots,x_k)\!</math> such that for any μ-recursive function <math>f(x_1,\ldots,x_k)\!</math> with ''k'' free variables there is an ''e'' such that
| |
| :<math>f(x_1,\ldots,x_k) \simeq U(\mu y\, T(y,e,x_1,\ldots,x_k))</math>.
| |
| The number ''e'' is called an '''index''' or '''Gödel number''' for the function ''f''. A consequence of this result is that any μ-recursive function can be defined using a single instance of the μ operator applied to a (total) primitive recursive function.
| |
| | |
| Minsky (1967) observes (as does Boolos-Burgess-Jeffrey (2002) pp. 94–95) that the U defined above is in essence the μ-recursive equivalent of the [[universal Turing machine]]:
| |
| :To construct U is to write down the definition of a general-recursive function U(n, x) that correctly interprets the number n and computes the appropriate function of x. to construct U directly would involve essentially the same amount of effort, ''and essentially the same ideas'', as we have invested in constructing the universal Turing machine. (italics in original, Minsky (1967) p. 189)
| |
| | |
| == Symbolism ==
| |
| A number of different symbolisms are used in the literature. An advantage to using the symbolism is a derivation of a function by "nesting" of the operators one inside the other is easier to write in a compact form. In the following we will abbreviate the string of parameters x<sub>1</sub>, ..., x<sub>n</sub> as '''x''':
| |
| * '''Constant function''': Kleene uses " C<sub>q</sub><sup>n</sup>('''x''') = q " and Boolos-Burgess-Jeffry (2002) (B-B-J) use the abbreviation " const<sub>n</sub>( '''x''') = n ":
| |
| :: e.g. C<sub>13</sub><sup>7</sup> ( r, s, t, u, v, w, x ) = 13
| |
| :: e.g. const<sub>13</sub> ( r, s, t, u, v, w, x ) = 13
| |
| | |
| * '''Successor function''': Kleene uses x' and S for "Successor". As "successor" is considered to be primitive, most texts use the apostrophe as follows:
| |
| :: S(a) = a +1 =<sub>def</sub> a', where 1 =<sub>def</sub> 0', 2 =<sub>def</sub> 0 ' ', etc.
| |
| | |
| * '''Identity function''': Kleene (1952) uses " U<sub>i</sub><sup>n</sup> " to indicate the identity function over the variables x<sub>i</sub>; B-B-J use the identity function id<sub>i</sub><sup>n</sup> over the variables x<sub>1</sub> to x<sub>n</sub>:
| |
| : U<sub>i</sub><sup>n</sup>( '''x''' ) = id<sub>i</sub><sup>n</sup>( '''x''' ) = x<sub>i</sub>
| |
| : e.g. U<sub>3</sub><sup>7</sup> = id<sub>3</sub><sup>7</sup> ( r, s, t, u, v, w, x ) = t
| |
| | |
| * '''Composition (Substitution) operator''': Kleene uses a bold-face '''S'''<sub>n</sub><sup>m</sup> (not to be confused with his S for "successor" '''!''' ). The superscript "m" refers to the m<sup>th</sup> of function "f<sub>m</sub>", whereas the subscript "n" refers to the n<sup>th</sup> variable "x<sub>n</sub>":
| |
| :If we are given h( '''x''' )= g( f<sub>1</sub>('''x'''), ... , f<sub>m</sub>('''x''') )
| |
| :: h('''x''') = '''S'''<sub>m</sub><sup>n</sup>(g, f<sub>1</sub>, ... , f<sub>m</sub> ) | |
| | |
| :In a similar manner, but without the sub- and superscripts, B-B-J write:
| |
| :: h(''x''')= Cn[g, f<sub>1</sub> ,..., f<sub>m</sub>]('''x''')
| |
| | |
| * '''Primitive Recursion''': Kleene uses the symbol " '''R'''<sup>n</sup>(base step, induction step) " where n indicates the number of variables, B-B-J use " Pr(base step, induction step)('''x''')". Given:
| |
| :* base step: h( 0, '''x''' )= f( '''x''' ), and
| |
| :* induction step: h( y+1, '''x''' ) = g( y, h(y, '''x'''),'''x''' )
| |
|
| |
| : Example: primitive recursion definition of a + b:
| |
| ::* base step: f( 0, a ) = a = U<sub>1</sub><sup>1</sup>(a)
| |
| ::* induction step: f( b' , a ) = ( f ( b, a ) )' = g( b, f( b, a), a ) = g( b, c, a ) = c' = S(U<sub>2</sub><sup>3</sup>( b, c, a ) | |
| ::: R<sup>2</sup> { U<sub>1</sub><sup>1</sup>(a), S [ (U<sub>2</sub><sup>3</sup>( b, c, a ) ] }
| |
| ::: Pr{ U<sub>1</sub><sup>1</sup>(a), S[ (U<sub>2</sub><sup>3</sup>( b, c, a ) ] }
| |
| | |
| '''Example''': Kleene gives an example of how to perform the recursive derivation of f(b, a) = b + a (notice reversal of variables a and b). He starting with 3 initial functions
| |
| :# S(a) = a'
| |
| :# U<sub>1</sub><sup>1</sup>(a) = a
| |
| :# U<sub>2</sub><sup>3</sup>( b, c, a ) = c
| |
| :# g(b, c, a) = S(U<sub>2</sub><sup>3</sup>( b, c, a )) = c'
| |
| :# base step: h( 0, a ) = U<sub>1</sub><sup>1</sup>(a)
| |
| :: induction step: h( b', a ) = g( b, h( b, a ), a )
| |
| | |
| He arrives at:
| |
| :: a+b = '''R'''<sup>2</sup>[ U<sub>1</sub><sup>1</sup>, '''S'''<sub>1</sub><sup>3</sup>(S, U<sub>2</sub><sup>3</sup>) ]
| |
| | |
| ==Examples==
| |
| * [[Fibonacci number]]
| |
| * [[McCarthy 91 function]]
| |
| | |
| ==See also==
| |
| *[[Recursion theory]]
| |
| * [[Recursion]]
| |
| * [[Recursion (computer science)]]
| |
| | |
| ==External links==
| |
| *[http://plato.stanford.edu/entries/recursive-functions/ Stanford Encyclopedia of Philosophy entry]
| |
| | |
| == References == | |
| *[[Stephen Kleene]] (1952) ''Introduction to Metamathematics''. Walters-Noordhoff & North-Holland, with corrections (6th imprint 1971); Tenth impression 1991, ISBN 0-7204-2103-9.
| |
| *Soare, R. Recursively enumerable sets and degrees. Springer-Verlag 1987.
| |
| *[[Marvin L. Minsky]] (1967), ''Computation: Finite and Infinite Machines'', Prentice-Hall, Inc. Englewood Cliffs, N.J.
| |
| :On pages 210-215 Minsky shows how to create the μ-operator using the [[register machine]] model, thus demonstrating its equivalence to the general recursive functions.
| |
| *[[George Boolos]], [[John P. Burgess|John Burgess]], [[Richard Jeffrey]] (2002), ''Computability and Logic: Fourth Edition'', Cambridge University Press, Cambridge, UK. Cf pp. 70–71.
| |
| | |
| {{DEFAULTSORT:Mu-Recursive Function}}
| |
| [[Category:Computability theory]]
| |
| [[Category:Theory of computation]]
| |
| | |
| [[ru:Рекурсивная функция (теория вычислимости)#Частично рекурсивная функция]]
| |