Sentence examples for recursive natural from inspiring English sources

This network of recursive natural guidance structures constitutes the complex network of natural dào.

For every recursive set of natural numbers X and every recursive function g(n) there exists a finitely presented residually finite semigroup S such that the depth function of S is bigger than g(n).

On the other hand, we support the traditional process for creating a new coding system in medicine which is very much labour consuming by artificial intelligence tools using a medically oriented recursive ontology and natural language processing.

For every recursive set of natural numbers X and every recursive function g(n) there exists a finitely presented residually finite semigroup S such that the word problem in S is as hard as the membership problem in X and polynomially reduces to it; the Dehn function S is bigger than g(n).

For every recursive set of natural numbers X and every recursive function g(n) there exists a finitely presented residually finite solvable of class 3 group G such that the word problem in G is as hard as the membership problem in X and polynomially reduces to it; the Dehn function G is bigger than g(n).

One of our main results is the following theorem (an immediate corollary of Theorem 4.21 below): For every recursive set of natural numbers X there exists a finitely presented residually finite solvable group G of class 3 such that the word problem in G is as hard as the membership problem in X.

A set is recursively enumerable iff it is the range of a (total or partial) recursive function on the natural numbers (Boolos et al. 2003: §8.3).

We shall prove this theorem by employing the recursive method on the natural number j.

It is proved in [13] that for every recursive set X of natural numbers, that is accepted by a deterministic Turing machine M there exists a universally halting deterministic Turing machine (M') with one tape accepting X.

Moreover, finitary programs allow a more natural encoding of recursive data structures and may increase the performance of credulous reasoners.

A sequence of sets G1, G2, … is uniformly effective open if there is a recursive function f from pairs of natural numbers (m, n) to basic sets such that each Gm = ∪∞n=1 N(f(m, n)).