| 单词 |
partial recursive function |
| 释义 |
partial recursive function partial recursive function[¦pär·shəl rē‚kər·siv ′fəŋk·shən] (mathematics) A function that can be computed by using a Turing machine for some inputs but not necessarily for all inputs. |
| 随便看 |
- bonhöffer
- boni
- boniak
- boniata
- boniato
- boniatos
- bonibell
- bonichi, gino
- bonier
- boniest
- boniface
- boniface ix
- boniface, saint
- desniak, oleksa
- desnitsa
- desnitskaia, agniia
- desnitskaia, agniia vasilevna
- desnitskii, semen
- desnitskii, semen efimovich
- desnitskii, vasilii
- desnitskii, vasilii alekseevich
- desnood
- de&s northwest inc.
- de&s northwest, incorporated
- des nos
|