Advertisement
 Translation for 'F N' from English to Bulgarian
Usage Examples English
  • "F.N.G." is a compilation album by hardcore/crossover band Suicidal Tendencies.
  • But bounding the computation time above by some concrete function "f"("n") often yields complexity classes that depend on the chosen machine model.
  • Let "F"("n") denote the "n"-th Fibonacci number.
  • (5) ⇒ (6) because if γ is a piecewise closed curve and "f'n" are successive square roots of "z" − "w" for "w" outside "G", then the winding number of "f'n" ∘ γ about "w" is 2"n" times the winding number of γ about 0.
  • In number theory, an arithmetic, arithmetical, or number-theoretic function is for most authors any function "f"("n") whose domain is the positive integers and whose range is a subset of the complex numbers.

  • In Arthur–Merlin protocols, Babai defined a similar class AM[...] which allowed "f"("n") rounds, but he put one extra condition on the machine: the verifier must show the prover all the random bits it uses in its computation.
  • It is defined as a ratio, "f" = "N"/"T", involving the number of times an event happened ("N") during a given time duration ("T"); it is a physical quantity of type temporal rate.
  • If the Euclidean algorithm requires "N" steps for a pair of natural numbers "a" > "b" > 0, the smallest values of "a" and "b" for which this is true are the Fibonacci numbers "F'N"+2 and "F'N"+1, respectively.
  • Since "Fn" is asymptotic to [...] , the number of digits in "F'n" is asymptotic to [...].
  • One mole of particles given 1 eV of energy each has approximately 96.5 kJ of energy – this corresponds to the Faraday constant ("F" ≈ [...]), where the energy in joules of "n" moles of particles each with energy "E" eV is equal to "E"·"F"·"n".

  • Radó's 1962 paper proved that if [...] is any computable function, then Σ("n") > "f"("n") for all sufficiently large "n", and hence that Σ is not a computable function.
  • Both theorems use the notion of a time-constructible function.
  • "The Alter" did not author any books or essays personally, but some of his ethical discourses were published under the name ' - "The Hidden Light" (also meaning "The Light of the Hidden (One)").
  • A finer analysis has been conducted for computably bounded trees.
  • The probability measure on Cantor space, sometimes called the fair-coin measure, is defined so that for any binary string "x" the set of sequences that begin with "x" has measure 2−|"x"|.

  • The types of questions addressed in this case are about the largest possible graph which satisfies certain properties.
  • A function may be recursively defined in terms of itself.
Advertisement
© dict.cc English-Bulgarian dictionary 2024
Contains translations by TU Chemnitz and Mr Honey's Business Dictionary (German-English only).
Links to this dictionary or to individual translations are very welcome!