Calculable function
A calculable Fonction (or recursive Fonction) is a semi-calculable Fonction (or recursive Fonction partial) which is also total, i.e. definite for very entered (in any point). They are the functions calculated by a machine of Turing “which finishes”.
Simple: Computable function
| Random links: | Albert Ducrocq | Tirada D | Dozulé | Kabul | Dioscoreales | enfermedad de la Hoz-célula | Plate of the Easter Island | Harold Lowe | Presseur_de_Murray |