例句與造句

1. Mechanisms for discretizing continuous data include Fayyad & Irani's MDL method, which uses mutual information to recursively define the best bins, CAIM, CACC, Ameva, and many others
2. Corecursion is then a technique for recursively defining functions whose range ( codomain ) is a final data type, dual to the way that ordinary recursion recursively defines functions whose domain is an initial data type.
3. Corecursion is then a technique for recursively defining functions whose range ( codomain ) is a final data type, dual to the way that ordinary recursion recursively defines functions whose domain is an initial data type.
4. The definition of " inductive " reasoning described in this article excludes mathematical induction, which is a form of " deductive " reasoning that is used to strictly prove properties of recursively defined sets.
5. A subspace, AB & XY may thus be recursively defined in terms of the subspace AB & X as that containing all the points of all lines YZ, as Z ranges over AB & X . Collinearity then generalizes to the relation of " independence ".
6. It's difficult to find recursively define in a sentence. 用recursively define造句挺難的
7. Every recursively defined function can be seen as a fixed point of some suitably defined function closing over the recursive call with an extra argument, and therefore, using "'Y "', every recursively defined function can be expressed as a lambda expression.
8. Every recursively defined function can be seen as a fixed point of some suitably defined function closing over the recursive call with an extra argument, and therefore, using "'Y "', every recursively defined function can be expressed as a lambda expression.
9. "A recursively defined set C with a successor function of the form S : C ^ n \ to C, where n is a positive integer, is " freely generated " if both S is injective and "'the image of S does not contain any elements introduced in the basis "'".
10. One such function, which is provable total but not primitive recursive, is Ackermann function : since it is recursively defined, it is indeed easy to prove its computability ( However, a similar diagonalization argument can also be built for all functions defined by recursive definition; thus, there are provable total functions that cannot be defined recursively ).
11. He shows how one can generate a partially defined truth predicate ( one that remains undefined for problematic sentences like " This sentence is not true " ), by recursively defining " truth " starting from the segment of a language that contains no occurrences of the word, and continuing until the process ceases to yield any newly well-defined sentences . ( This takes a denumerable infinity of steps . ) That is, for a language L, let L-prime be the language generated by adding to L, for each sentence S in L, the sentence " " S " is true . " A fixed point is reached when L-prime is L; at this point sentences like " This sentence is not true " remain undefined, so, according to Kripke, the theory is suitable for a natural language that contains its " own " truth predicate.
更多例句：  上一頁(yè)