Could you please explain the solutions of the exercises? The definition of $\mu$- recursive finctions is clear to me, but I want to know the way of thinking to solve the exercises.
Thank you.
$\begingroup$
$\endgroup$
3
-
$\begingroup$ The notation here to me is super confusing, but maybe this is standard between people into algorithms $\endgroup$tommy1996q– tommy1996q2024-09-04 10:53:57 +00:00Commented Sep 4, 2024 at 10:53
-
$\begingroup$ Thank you for your reply. I can simplify that or write it in an equivalent form: $\endgroup$soso sos– soso sos2024-09-04 10:58:36 +00:00Commented Sep 4, 2024 at 10:58
-
$\begingroup$ In A $g(x,u)=x+u-2$ and in B$g(x,y,z,w)=x-yw+z$ $\endgroup$soso sos– soso sos2024-09-04 11:01:11 +00:00Commented Sep 4, 2024 at 11:01
Add a comment
|