Select Keyboard: Türkçe ▾ X
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||
الإنجليزية - الإنجليزية
تعريف recursion theory في الإنجليزية الإنجليزية القاموس.
- A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as "What does it mean for a function from the natural numbers to themselves to be computable?" and "Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?"
- computability theory
recursion theory
الواصلة
re·cur·sion the·o·ryالمترادفات
computability theoryالنطق
Resimler
السابق
المفضلات