Poincaré recurrence theorem
farbin-e bâzâmad-e Poincaré
Fr.: théorème de récurrence de Poincaré
1) A person or thing that comes before another of the same kind;
Fr.: pulse précurseur
A component of a → pulsar pulse that appears shortly in advance of the main pulse.
Fr.: se reproduire périodiquement, revenir
To occur again, as an event, experience, etc.
Bâzâmadan "to come back, return," from bâz, → re-, + âmadan "to come, arrive, become" (present stem ây-); Av. ay- "to go, to come," aēiti "goes;" O.Pers. aitiy "goes;" Skt. e- "to come near," eti "arrival;" L. ire "to go;" Goth. iddja "went;" Lith. eiti "to go;" Rus. idti "to go."
1) An act or instance of recurring.
Verbal noun of → recur.
Fr.: relation de recurrence
A → sequence based on a → rule that gives the next → term as a → function of the previous term(s). For example, the sequence 3, 9, 21, 45,... can be represented by the recurrence relation un+1 = 2un + 3, where u1 = 3 and n ≥ 1.
Occurring or appearing again, especially repeatedly or periodically (Dictionary.com). → recurrence nova.
Verbal adj. from → recur.
novâ-ye bâzâyand, now-axtar-e ~
Fr.: nova récurrente
Fr.: récursion, récursivité
1) A running backward, return.
From L. recursionem (nominative recursio); → recurrent.
Bâzâneš, verbal noun of bâzâmadan, → recur.
1) Pertaining to or using a rule or procedure that can be applied repeatedly.
Adjective from → recursion.
Fr.: définition récursive
Math.: A definition of a function from which values of the same function can be calculated in a finite number of steps. In mathematical logic and computer science, a recursive definition is used to define an object in terms of itself. An example is the → factorial: n! = n*(n-1)!