Synonymer & Information om | Engelska ordet NONRECURSIVE

Exempel på hur man kan använda NONRECURSIVE i en mening

• The problem of deciding whether for a given Datalog program there is an equivalent nonrecursive program (corresponding to a positive relational algebra query, or, equivalently, a formula of positive existential first-order logic, or, as a special case, a conjunctive query) is known as the Datalog boundedness problem and is undecidable.

Förberedelsen av sidan tog: 56,68 ms.