-1
$\begingroup$

I have seen and understood the most definitions but i just could not understand how to show if a function is mu-partial recursive or not. I used search engines, but all I find are just more lectures with definitions...

Lets say I have a function like

f(x) = x^2 

or

f(x)=root(x+5) + 5 

Can you proof if those functions are mu-partial recursive? Explain why this function is mu-partial recurisve.

  • 0
    Ok. I was just stunned that nobody could answer such an easy question/function if f(x)=root(x+5)+5 is mu-partial recursive and why it is mu-partial recursive.2012-12-09

1 Answers 1

1

I'm not sure what type of answer you're supposed to give, but partial recursive functions correspond to all computable functions. Thus, if you can write a computer program to represent the function, it's partial recursive. Either that or you can start from the definitions and build up to the functions you are given. In this case, both of your examples are clearly partial-recursive.

  • 0
    I know it's a definition, but using the definition and some thinking will allow you to come u$p$ with an answer. Plus, I told you the answer.2012-12-11