general recursive function

/JH EH1 N ER0 AH0 L R IY0 K ER0 S IH0 V F AH0 NG K SH AH0 N/
N
  1. 1

    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.

Translate “general recursive function” into another language

Choose a language below to open the translator with English selected as the source language.

🇪🇸Spanish🇫🇷French🇩🇪German🇸🇦Arabic🇨🇳Chinese Simplified🇯🇵Japanese🇮🇳Hindi🇧🇷Portuguese🇷🇺Russian🇰🇷Korean🇮🇹Italian🇹🇷Turkish
See all 248+ languages
Back to Dictionary