Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02003316n
Noun Concept
Categories: Computability theory, Theory of computation
EN
general recursive function  μ-recursive function  General-recursive  general recursive  M-recursive function
EN
In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense – as well as in a formal one. Wikipedia
Definitions
Relations
Sources
EN
In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense – as well as in a formal one. Wikipedia
Defined from a particular formal model of computable functions using primitive recursion and the μ operator Wikipedia Disambiguation
A computable partial function from natural numbers to natural numbers Wikipedia Disambiguation
One of several equivalent definitions of a computable function Wikidata
IS A
function
HAS KIND
Ackermann function
Sudan function
HAS INSTANCE
McCarthy 91 function
Wikipedia
EN
general recursive function
Wikidata
EN
μ-recursive function
Wikipedia Redirections
EN
General-recursive, general recursive, M-recursive function, Mu-recursive, mu-recursive function, mu recursive function, partial recursive function, μ-recursive, μ-recursive function, Μ recursion
Wikidata Alias
EN
general recursive function, partial recursive function, recursive function

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License