Find link

language: af: Afrikaans als: Alemannisch [Alemannic] am: አማርኛ [Amharic] an: aragonés [Aragonese] ar: العربية [Arabic] arz: مصرى [Egyptian Arabic] as: অসমীয়া [Assamese] ast: asturianu [Asturian] az: azərbaycanca [Azerbaijani] azb: تۆرکجه [Southern Azerbaijani] ba: башҡортса [Bashkir] bar: Boarisch [Bavarian] bat-smg: žemaitėška [Samogitian] be: беларуская [Belarusian] be-tarask: беларуская (тарашкевіца) [Belarusian (Taraškievica)] bg: български [Bulgarian] bn: বাংলা [Bengali] bpy: বিষ্ণুপ্রিয়া মণিপুরী [Bishnupriya Manipuri] br: brezhoneg [Breton] bs: bosanski [Bosnian] bug: ᨅᨔ ᨕᨘᨁᨗ [Buginese] ca: català [Catalan] ce: нохчийн [Chechen] ceb: Cebuano ckb: کوردیی ناوەندی [Kurdish (Sorani)] cs: čeština [Czech] cv: Чӑвашла [Chuvash] cy: Cymraeg [Welsh] da: dansk [Danish] de: Deutsch [German] el: Ελληνικά [Greek] en: English eo: Esperanto es: español [Spanish] et: eesti [Estonian] eu: euskara [Basque] fa: فارسی [Persian] fi: suomi [Finnish] fo: føroyskt [Faroese] fr: français [French] fy: Frysk [West Frisian] ga: Gaeilge [Irish] gd: Gàidhlig [Scottish Gaelic] gl: galego [Galician] gu: ગુજરાતી [Gujarati] he: עברית [Hebrew] hi: हिन्दी [Hindi] hr: hrvatski [Croatian] hsb: hornjoserbsce [Upper Sorbian] ht: Kreyòl ayisyen [Haitian] hu: magyar [Hungarian] hy: Հայերեն [Armenian] ia: interlingua [Interlingua] id: Bahasa Indonesia [Indonesian] io: Ido is: íslenska [Icelandic] it: italiano [Italian] ja: 日本語 [Japanese] jv: Basa Jawa [Javanese] ka: ქართული [Georgian] kk: қазақша [Kazakh] kn: ಕನ್ನಡ [Kannada] ko: 한국어 [Korean] ku: Kurdî [Kurdish (Kurmanji)] ky: Кыргызча [Kirghiz] la: Latina [Latin] lb: Lëtzebuergesch [Luxembourgish] li: Limburgs [Limburgish] lmo: lumbaart [Lombard] lt: lietuvių [Lithuanian] lv: latviešu [Latvian] map-bms: Basa Banyumasan [Banyumasan] mg: Malagasy min: Baso Minangkabau [Minangkabau] mk: македонски [Macedonian] ml: മലയാളം [Malayalam] mn: монгол [Mongolian] mr: मराठी [Marathi] mrj: кырык мары [Hill Mari] ms: Bahasa Melayu [Malay] my: မြန်မာဘာသာ [Burmese] mzn: مازِرونی [Mazandarani] nah: Nāhuatl [Nahuatl] nap: Napulitano [Neapolitan] nds: Plattdüütsch [Low Saxon] ne: नेपाली [Nepali] new: नेपाल भाषा [Newar] nl: Nederlands [Dutch] nn: norsk nynorsk [Norwegian (Nynorsk)] no: norsk bokmål [Norwegian (Bokmål)] oc: occitan [Occitan] or: ଓଡ଼ିଆ [Oriya] os: Ирон [Ossetian] pa: ਪੰਜਾਬੀ [Eastern Punjabi] pl: polski [Polish] pms: Piemontèis [Piedmontese] pnb: پنجابی [Western Punjabi] pt: português [Portuguese] qu: Runa Simi [Quechua] ro: română [Romanian] ru: русский [Russian] sa: संस्कृतम् [Sanskrit] sah: саха тыла [Sakha] scn: sicilianu [Sicilian] sco: Scots sh: srpskohrvatski / српскохрватски [Serbo-Croatian] si: සිංහල [Sinhalese] simple: Simple English sk: slovenčina [Slovak] sl: slovenščina [Slovenian] sq: shqip [Albanian] sr: српски / srpski [Serbian] su: Basa Sunda [Sundanese] sv: svenska [Swedish] sw: Kiswahili [Swahili] ta: தமிழ் [Tamil] te: తెలుగు [Telugu] tg: тоҷикӣ [Tajik] th: ไทย [Thai] tl: Tagalog tr: Türkçe [Turkish] tt: татарча/tatarça [Tatar] uk: українська [Ukrainian] ur: اردو [Urdu] uz: oʻzbekcha/ўзбекча [Uzbek] vec: vèneto [Venetian] vi: Tiếng Việt [Vietnamese] vo: Volapük wa: walon [Walloon] war: Winaray [Waray] yi: ייִדיש [Yiddish] yo: Yorùbá [Yoruba] zh: 中文 [Chinese] zh-min-nan: Bân-lâm-gú [Min Nan] zh-yue: 粵語 [Cantonese]

jump to random article

searching for Recursive definition 81 found (105 total)

alternate case: recursive definition

Geometric modeling (551 words) [view diff] exact match in snippet view article find links to article

partition of space; and with fractal models that give an infinitely recursive definition of the shape. However, these distinctions are often blurred: for

In mathematics, specifically in commutative algebra, the elementary symmetric polynomials are one type of basic building block for symmetric polynomials

metamathematics especially proof theory. A generative grammar can be seen as a recursive definition in string theory. The most basic operation on strings is concatenation;

size n / 2 {\displaystyle n/2} . This implementation follows the recursive definition of the 2 m × 2 m {\displaystyle 2^{m}\times 2^{m}} Hadamard matrix

the appropriate value at 0; any value would be consistent with the recursive definition. A smooth extension to the reals would satisfy f ( 0 ) = f ′ ( 1

Hofstadter provided this definition: "Superrational thinkers, by recursive definition, include in their calculations the fact that they are in a group

The cluster-expansion approach is a technique in quantum mechanics that systematically truncates the BBGKY hierarchy problem that arises when quantum dynamics

_{2}+\mathbf {P} _{1})\,.} Bézier curves can be defined for any degree n. A recursive definition for the Bézier curve of degree n expresses it as a point-to-point

"multidigraph". In a correspondence to the types of entities used in the recursive definition, each node of an apq is assigned a type (1), (2a), (2b), (2c) or

also maps rational numbers to dyadic rationals, as can be seen by a recursive definition closely related to the Stern–Brocot tree. One way to define the question-mark

In mathematics, the determinant of an m-by-m skew-symmetric matrix can always be written as the square of a polynomial in the matrix entries, a polynomial

are finite sets, recursively all the way down to the empty set. A recursive definition of well-founded hereditarily finite sets is as follows: Base case:

In mathematics, the Laguerre polynomials, named after Edmond Laguerre (1834–1886), are nontrivial solutions of Laguerre's differential equation: x y ″

thing with the children. This mutually recursive definition can be converted to a singly recursive definition by inlining the definition of a forest:

digital surfaces. The digital manifold was studied in the 1990s. A recursive definition of the digital k-manifold was proposed intuitively by Chen and Zhang

into the definition of the rank of a set gives a self-contained recursive definition: The rank of a set is the smallest ordinal number strictly greater

transformed into a tail-recursive definition by adding an argument a called an accumulator. This Julia program gives a tail-recursive definition fact_iter of the

numbers that is more efficient than the one given by their original recursive definition: ( m + 3 m ) B m = { m + 3 3 − ∑ j = 1 m 6 ( m + 3 m − 6 j ) B m

highly connected to systemically important banks, and so on. The recursive definition is equivalent to performing eigendecomposition of a matrix of connectivity

complete it is highly tuned for matching text, and even a simple (recursive) definition of the factorial takes almost ten lines. Part of this is because

follows from the recursive definition of r d x ( n ) {\displaystyle \mathbf {r} _{dx}(n)} . Next we incorporate the recursive definition of P ( n ) {\displaystyle

else return n * factorial(n-1); } To provide a meaning for this recursive definition, the denotation is built up as the limit of approximations, where

(approximately 1.44 log2 n). Skew heaps may be described with the following recursive definition:[citation needed][clarification needed] A heap with only one element

{\displaystyle AMP_{1}=H_{2}+MR_{2}\cdot AMP_{2}} In this manner, this recursive definition can be extended throughout all layers of the memory hierarchy. John

{\displaystyle \langle 0,0\rangle } . Not every recursive definition can be transformed into a primitive recursive definition. One known example is Ackermann's function

<- 2 to n } In A }; Note the use of non-strict evaluation in the recursive definition of the array A. Id's lenient evaluation strategy allows cyclic datastructures

calculus could be formulated using a single binary predicate, if the recursive definition of a term was sufficiently rich. (This result is commonly attributed

numbers, and complex numbers. One such way for doing so is using a recursive definition for tetration; for any positive real a > 0 {\displaystyle a>0} and

replaces each edge of a square tiling with a dragon curve, using the recursive definition of the dragon starting from a line segment. The initial direction

every open cover has a finite subcover"). Moreover, in the case of a recursive definition, the only if half of the definition is interpreted as a sentence

a member of the description logic family is characterized by its recursive definition, in which the constructors that can be used to form concept terms

whose vertex figures are all regular and congruent. This is a "recursive" definition. It defines regularity of higher dimensional figures in terms of

determinants of smaller matrices. This expansion can be used for a recursive definition of determinants (taking as starting case the determinant of a 1×1

;;; n! = n*(n-1)! This defines the factorial function using its recursive definition. In contrast, it is more typical to define a procedure for an imperative

the tail-recursive version. This is an equivalent mutually tail-recursive definition: M m t ( n ) = M m t ′ ( n , 0 ) {\displaystyle M_{mt}(n)=M_{mt}'(n

the tail-recursive version. This is an equivalent mutually tail-recursive definition: M m t ( n ) = M m t ′ ( n , 0 ) {\displaystyle M_{mt}(n)=M_{mt}'(n

all structures in a particular language, which is clearly not a recursive definition. Also, it makes the concept of "provability", and thus of "theorem"

exch 0 eq or not { dup 1 sub fib exch 2 sub fib add } if } def A recursive definition is used on the stack. The Fibonacci number function takes one argument

Huffman coding and color indexing transform. This format uses a recursive definition: all of the control images, such as the local entropy code selection

factorial values for increasing numbers 1, 2, 3... as in the above recursive definition with "time arrow" reversed, as it were, by reading it backwards as

Priority-encoder (left) symbol (right) recursive definition.

end end else node(min, left, right) end; Another example is the recursive definition of a process tree: procedure tree(depth: integer, bottom: channel);

but also any real number in between (e.g. 0.25). Valuations have a recursive definition where: w ( θ ∘ ϕ ) = F ∘ ( w ( θ ) , w ( ϕ ) ) {\displaystyle w(\theta

above Fourier series for T w ( x ) . {\displaystyle T_{w}(x).} The recursive definition allows the monoid of self-symmetries of the curve to be given. This

Variational Principles. Courier Dover Publications. ISBN 0-486-65840-6. A recursive definition requires a first case, which may be taken as δ = 1 for p = 0, or

{\displaystyle (z+1)^{2}>x} . Using the minimization operator, a general recursive definition is Isqrt = μ ( Not ∘ Gt ∘ ( Mul ∘ ( S ∘ P 1 2 , S ∘ P 1 2 ) , P 2

"Formal model of internal measurement: Alternate changing between recursive definition and domain equation". Physica D: Nonlinear Phenomena. 110 (3–4):

the treatment of functions lend themselves extremely well for a recursive definition of a variadic compositional operator. (define (compose . fs) (if

there is none */ }; This pointer-recursive definition is essentially the same as the reference-recursive definition from the language Haskell: data Link

A graphical representation of the Bethe–Salpeter equation, showing its recursive definition

Tarski formulated his definition of truth indirectly through a recursive definition of the satisfaction of sentential functions and then by defining

0 else n1 * g(n1 - 1)) fact = Y(fact1) Combining these yields a recursive definition of the factorial in lambda calculus (anonymous functions of a single

well-defined even if the rank of the monoid is infinite, as the above recursive definition works for all strings of finite length. String projection is a morphism

assures that S is an injection. Axioms (4) and (5) are the standard recursive definition of addition; (6) and (7) do the same for multiplication. Robinson

this process may be recursively continued, giving the following recursive definition of δ ^ : Q × Σ ⋆ → Q {\displaystyle {\widehat {\delta }}:Q\times

possible lengths of c 1 {\displaystyle c_{1}} immediately gives the recursive definition C 0 = 1 and C n + 1 = ∑ i = 0 n C i C n − i for  n ≥ 0 {\displaystyle

expressed as the fixed point of some uniform morphism alone. There is a recursive definition { r 2 n = r n r 2 n + 1 = ( − 1 ) n r n {\displaystyle

\\u(Sx)&=S_{X}(ux).\end{aligned}}} This is precisely the recursive definition of 0X and SX. When the Peano axioms were first proposed, Bertrand

x_{1}=T(x_{0},a_{0})} . Therefore, the problem can be rewritten as a recursive definition of the value function: V ( x 0 ) = max a 0 { F ( x 0 , a 0 ) + β

describes the syntax of a language and itself has a syntax. This recursive definition is an example of a metalanguage. The syntax of BNF includes: ::=

before the possible allocation of the next seat. An equivalent, recursive definition is A m + 1 = m m + 2   A m {\displaystyle A_{m+1}={\sqrt {\frac {m}{m+2}}}\

would be}}\leq x\\x_{k-1}&{\text{otherwise}}\end{cases}}} Given this recursive definition and because x k {\displaystyle x_{k}} is strictly increasing, it

determinants of smaller matrices. This expansion can be used for a recursive definition of determinants (taking as starting case the determinant of a 1-by-1

permutation pattern poset which is more efficient than the naïve recursive definition. The first such result was established by Sagan & Vatter (2006),

left with exactly one object in exactly one pile. So, using our recursive definition, Bob really only has one move: ∗ 1 {\displaystyle *1} . Thus, Bob's

determine its Dirichlet inverse exactly without resorting to a standard recursive definition of this function via yet another convolved divisor sum involving

theory specifies the rules of syntax (rules of grammar) usually as a recursive definition that starts with "0" and specifies how to build acceptable strings

\bigwedge }^{\!n}(V)\to {\textstyle \bigwedge }^{\!n-k}(V)} by the recursive definition ι α ∧ β = ι β ∘ ι α . {\displaystyle \iota _{\alpha \wedge \beta

counting, "proof by induction"); and (3) the definition by induction (recursive definition of "number-theoretic functions or predicates). With regards to (3)

{A} _{m+1}(n)&=&\operatorname {A} _{m}^{n+1}(1)\\\end{array}}} The recursive definition of the Ackermann function can naturally be transposed to a term rewriting

n=\operatorname {divide1} \ (\operatorname {succ} \ n)} divide1 is a recursive definition. The Y combinator may be used to implement the recursion. Create

0; in other words, { | } is a form of the surreal number 0. The recursive definition of surreal numbers is completed by defining comparison: Given numeric

presents a state machine that will do the job, and by use of induction (recursive definition) Minsky proves the "method" and presents a theorem as the result

SqList(s) == if s = [] then [] else [(hd s)**2] ^ SqList(tl s) This recursive definition consists of a function signature giving the types of the input and

1080/00045608.2013.765773. S2CID 119257295. Jiang, Bin (2019). "A Recursive Definition of Goodness of Space for Bridging the Concepts of Space and Place

connected to SOP programming constructs. A Composite service has a recursive definition meaning that any service inside ("inner service") may be another

\alpha .(\alpha \rightarrow \alpha )\rightarrow \alpha } . A possible recursive definition could thus be formulated as r e c   v = e 1   i n   e 2   ::= l e

{\mathrm {def.} }{=}}\left\{z:z\in x\vee z\in y\right\}} This is a recursive definition of unordered n {\displaystyle n} -tuples for any concrete n {\displaystyle

Form And Recursive Definition / Constraint Description Simple No No Definition Simple non recursive function definition. Recursive No Yes Definition Recursive

construction. A Henneberg graph G {\displaystyle G} has the following recursive definition: G {\displaystyle G} is a single edge or G {\displaystyle G} can

theorem (analysis of algorithms) 2.  Kleene's recursion theorem recursive definition A definition of a function, set, or other mathematical object that