2 votes

What is formal definition of non-deterministic algorithm in context of primitive/general recursion?

You could easily make Kleene's $\mu$-recursive programs nondeterministic. A $\mu$-recursive program consists of a sequence of function symbols, each defined from previous ones by composition, ...
Siddharth's user avatar
  • 823

Only top scored, non community-wiki answers of a minimum length are eligible