A procedure that goes through recursion is said to be recursive. From Wordnik.com. [A Recursive Process « Write Anything] Reference
The simplest type of recursion occurs when a given function is iterated. From Wordnik.com. [Recursive Functions] Reference
So if you type in "recursion" in Google, those jokesters ask "did you mean recursion?". From Wordnik.com. [Did You Digg It?] Reference
Here composition is the natural way to combine functions, and primitive recursion is a restricted kind of recursion in which. From Wordnik.com. [Computability and Complexity] Reference
If you haven't noticed this one before, search for "recursion" and see what the result page offers as a suggestion under Did you mean. From Wordnik.com. [Google offers online giggles lovingly ensconced] Reference
For even more fun, trying entering the word "recursion" into the search box. From Wordnik.com. [Christian Science Monitor | All Stories] Reference
The "recursion" in this analogy was rather quick, just eight bars before the loop repeated. From Wordnik.com. [MSDN Blogs] Reference
But truth can be defined for all of them by recursion. From Wordnik.com. [Truth] Reference
LW: Time recursion plays a major role in this episode. From Wordnik.com. [The Twilight zone Episode Guide by Lauren Weinstein and Saul Jaffe] Reference
Again, we define the deducibility relation by recursion. From Wordnik.com. [Classical Logic] Reference
ID is an infinite recursion, a sure sign of a bad theory. From Wordnik.com. [On Thursday, the Legg report will be published along with...] Reference
There are two kinds of symmetry, repetition and recursion. From Wordnik.com. [Taste for Makers] Reference
A few amusing footnotes to the recursion-equation episode. From Wordnik.com. [Anatomy of a Paper: Part II, Calculation] Reference
In math and engineering, recursion, especially, is a big win. From Wordnik.com. [Taste for Makers] Reference
Other forms of double recursion, however, are not so reducible. From Wordnik.com. [Recursive Functions] Reference
Define a sequence of sets of formulas, by recursion, as follows. From Wordnik.com. [Classical Logic] Reference
It has true recursion, and is one of the more memorable episodes. From Wordnik.com. [The Twilight zone Episode Guide by Lauren Weinstein and Saul Jaffe] Reference
It's hard to imagine writing programs without using recursion, but. From Wordnik.com. [Beating the Averages] Reference
We then examine some theorems relating to these types of recursion. From Wordnik.com. [Recursive Functions] Reference
Michael's recursion study wasn't the only one she'd get out of this. From Wordnik.com. [Analog Science Fiction and Fact]
Hence, the definition of the DRS language is by simultaneous recursion. From Wordnik.com. [Discourse Representation Theory] Reference
Let us convince ourselves that this shows sum to be definable by recursion. From Wordnik.com. [Recursive Functions] Reference
The constructible hierarchy L is likewise defined by recursion on ordinals. From Wordnik.com. [Kurt GÃ¶del] Reference
The coastline was an indefinite recursion of islands and straits and inlets. From Wordnik.com. [A Fire Upon the Deep]
That and network administrators running DNS without disabling outside recursion. From Wordnik.com. [Wired Top Stories] Reference
We could repeat the recursion clauses for L to produce a full theory of truth for L². From Wordnik.com. [Truth] Reference
I talk about recursion falsely and the act itself is a step in some recursion of falsity. From Wordnik.com. [Things I no longer know (DIARY ALLSTARZ)] Reference
Iteration is obviously a special case of primitive recursion, on the number of iterations. From Wordnik.com. [Recursive Functions] Reference
As a simple example of a function definable by primitive recursion, consider arithmetic addition. From Wordnik.com. [Recursive Functions] Reference
If the language contained function symbols, the denotation function would be defined by recursion. From Wordnik.com. [Classical Logic] Reference
Indeed, recursion is the only known way to produce an infinite number of symbols from a finite base. From Wordnik.com. [The Language of Thought Hypothesis] Reference
When defining a function of many variables by primitive recursion, all variables except one are kept fixed. From Wordnik.com. [Recursive Functions] Reference
Primitive recursion with parameters relaxes this condition, and it allows substitutions for these variables. From Wordnik.com. [Recursive Functions] Reference
It is clear from the identity hn (x) = axn. that Archimedes 'double recursion is reducible to primitive recursion. From Wordnik.com. [Recursive Functions] Reference
Double recursion relaxes this condition, and it allows the recursion to happen on two variables instead of only one. From Wordnik.com. [Recursive Functions] Reference
The first use of a double recursion was made around 220 B.C. by Archimedes in his Sand Reckoner to solve the following problem. From Wordnik.com. [Recursive Functions] Reference
When defining by primitive recursion a function at a given argument, only the value for the immediately preceeding argument can be used. From Wordnik.com. [Recursive Functions] Reference
This line of thought gave impulse to the elaboration of syntactical methods within combinatory logic and to the rise of recursion theory. From Wordnik.com. [Paradoxes and Contemporary Logic] Reference
LearnThatWord and the Open Dictionary of English are programs by LearnThat Foundation, a 501(c)3 nonprofit.
Questions? Feedback? We want to hear from you!
Email us
or click here for instant support.
Copyright © 2005 and after - LearnThat Foundation. Patents pending.