「recursion」の共起表現(1語右で並び替え)

Weblio 辞書 > 英和辞典・和英辞典 > recursionの意味・解説 > recursionに関連した共起表現

意味

例文

類語

共起表現

「recursion」の共起表現一覧(1語右で並び替え)

該当件数 : 56件

consultancy and Infinite	Recursion and others.
lue-oriented Algorithmic Language), and adds	recursion and finite streams.
his worst case, there are O(log h) levels of	recursion and O(n) points considered within each level
The principles of bar induction and bar	recursion are the intuitionistic equivalents of the ax
This could be rewritten to avoid left	recursion as
Any mutual	recursion can be converted to direct recursion using p
This tail	recursion can be efficiently compiled as a loop, but c
It did not support local variables,	recursion, dynamic memory allocation, or structured pr
ly, consider the function g defined with the	recursion equations
Cygwin bash on Windows 7, showing the use of	recursion for factoring.
The first	recursion formula above is also satisfied by the power
e-generation procedures can be looped to add	recursion, giving the output the appearance of greater
	Recursion in computer programming is exemplified when
QUEL did not allow for	recursion in queries, making it difficult to inspect h
f can be defined without a course-of-values	recursion in any setting where it is possible to handl
f natural numbers and higher order primitive	recursion; in this system all functions provably recur
Bar	recursion is a generalized form of recursion developed
Mutual	recursion is a form of recursion where two mathematica
induction in the same fashion that primitive	recursion is related to ordinary induction, or transfi
One example application of	recursion is in parsers for programming languages.
PCRE:	Recursion is not supported; nor are features added in
The great advantage of	recursion is that an infinite set of possible sentence
is executed and results are merged while the	recursion is unwound.
The	recursion is repeated until the zero-containing rectan
Processing each bin in subsequent	recursion levels is data-dependent, however.
Immediate left	recursion occurs in rules of the form
ement tail-call optimization, allow infinite	recursion of a specific sort-tail recursion-to occur w
Proofs or constructions using induction and	recursion often use the axiom of choice to produce a w
In the top level of	recursion, opportunity for parallelism is in the Count
OL, having no concept of stacks and hence no	recursion or dynamically-allocated arrays.
he various mechanisms of computation such as	recursion or lazy evaluation can be emulated as well a
Whereas a paramorphism models primitive	recursion over an inductive data type, an apomorphism
e classes for generic programming and common	recursion patterns are supported.
onstruct eliminates the need for most simple	recursion patterns.
It had bugs, notably not implementing tail	recursion properly, but was one of the faster developm
The technique of	recursion, rather than being scary and mysterious, is
The	recursion stops when the current candidate set S is re
extends the sequence arbitrarily, using the	recursion term B to determine the effect, until a suff
	Recursion, the technique of functions calling themselv
At the ith level of the	recursion, the algorithm solves at most 2i subproblems
More formally, we can state the Transfinite	Recursion Theorem as follows.
ian/logician and expert on domain theory and	recursion theory (also known as computability theory).
egory theory applied to logic (proof theory,	recursion theory), theoretical computer science (lambd
Enderton also contributed to	recursion theory, the theory of definability, models o
In	recursion theory, 0 can be used to denote the Turing d
xpert on computability theory, also known as	recursion theory.
From	recursion to iterators
This version also uses	recursion to achieve a final answer.
ween waiting for input, and a prohibition on	recursion to remove the need for a stack.
are exactly 2i subproblems in each level of	recursion up to level log2h.
arrays, strings, variable array bounds, and	recursion) were omitted; but the implementors did incl
sive descent parser would fall into infinite	recursion when trying to parse a grammar which contain
As given above this algorithm involves deep	recursion which may cause stack overflow issues on som
st of the result is never demanded, then the	recursion will stop.
rithm supports full direct and indirect left	recursion without additional attendant complexity (but
per subroutine code section, there cannot be	recursion without considerable effort on the part of t

共起表現

「recursion」の共起表現(1語右で並び替え) - Weblio英語共起表現検索

「recursion」の共起表現一覧(1語右で並び替え)