Search results

...book |last=Khmelnik |first=S.I. |title= Computer Arithmetic of Functions. Algorithms and Hardware Design |work=Mathematics in Computers |location=Israel |year=2 ...ns coding method,<ref name="Khmelnik1"/> i.e. the functions representation by a "uniform" (for a function as a whole) positional code. And so the mention ...

{{short description|Formula for computing the nth base-16 digit of π}} ...'BBP formula''') is a formula for [[pi|{{pi}}]]. It was discovered in 1995 by [[Simon Plouffe]] and is named after the authors of the article in which it ...

...neralized Balanced Ternary (GBT) Applied to High-Performance Computational Algorithms |journal=APS Meeting Abstracts |date=August 1997|bibcode=1997APS..CPC..C409 ...a point <math>p</math> as powers of a '''base''' <math>B</math> multiplied by '''digits''' <math>d_i</math>. ...

...ed sequence of [[binary digits]] with [[pseudorandom]] properties, defined by {{harvs|txt | last1 = Ehrenfeucht | first1 = Andrzej | author1-link = Andrz The sequence starts with the single bit 0; each successive digit is formed by finding the longest suffix of the sequence that also occurs earlier within ...

...rom <math>0</math> to <math>n-1</math>, representing each of these numbers by its [[binary representation]] (padded to have length exactly <math>k</math> ..., with its values doubled, and the same sequence with each value increased by one. ...

Both Tunstall codes and Lempel–Ziv codes represent variable-length words by fixed-length codes.<ref> Given that there are three occurrences of letters followed by an L, the resulting probability is <math>{1 \over 3} \cdot {3 \over 12} = { ...

...s (loosely speaking) an infinite sum. While this result could be explained by the fact that every computable function from <math>\mathbb [0,1]</math> to ...sis]]. Instead, it is the stronger form of constructive analysis developed by [[L. E. J. Brouwer|Brouwer]] that provides a counterpart in [[constructive ...

The [[Fibonacci number]]s are defined by <math>F_0=0,</math> <math>F_1=1,</math> and ...show that <math>v_{n}\ge 1=F_2,</math> and <math>v_{n-1}\ge 2=F_3.</math> By [[Mathematical induction|induction]], ...

...performed at most once. This analogy is applied to the insertion operation by introducing ternary (skew) links, which link 3 trees together. This allows ...a skew binomial tree <math>t</math> of rank <math>r</math> is also bounded by <math>2^r \le |t| \le 2^{r+1}-1</math>. Since trees of the same rank may ha ...

...t''' is a series of [[convolutional neural network]] architectures created by a research group in [[AT&T Bell Laboratories]] during the 1988 to 1998 peri ...T LINK, see [[MOS:GEOLINK]] for further guidance-->, United States, headed by Lawrence D. Jackel.[[File:Yann_LeCun_-_2018_(cropped).jpg|thumb|Yann LeCun ...

...of fast summation of series of a special form. It was constructed in 1990 by [[Ekaterina Karatsuba]]<ref>E. A. Karatsuba, Fast evaluations of transcende ...re "similar to the exponential function," was given the name "E-functions" by [[Carl Ludwig Siegel]].<ref>C. L. Siegel, ...

...7 "Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment,"] June 10, 2020.</ref> ...lin Stahlke announced the computation of a discrete logarithm modulo a 232-digit (768-bit) safe prime, using the number field sieve. The computation was sta ...

...(Hrsg.): ''Number theory and cryptography.'' 1989</ref> Williams developed algorithms for calculating invariants of algebraic number fields such as class numbers ...sed in 1880 (at the age of 82) to factor the sixth [[Fermat number]] (a 20-digit number).<ref>Williams: ''How was <math>F_6</math> factored?'' In: ''Mathema ...

...[[trial and error]] method can be used. Simply pick an <math>a</math> and by computing the [[Legendre symbol]] <math>(\frac{a^2-n}p)</math> one can see Step 2 is to compute ''x'' by computing <math>x=\left( a + \sqrt{a^2-n} \right)^{(p+1)/2}</math> within ...

This example is shifted by adding one to the elements of an infinite Salem–Spencer set, the [[Stanley ...OEIS|A005836|mode=cs2}}</ref> Another infinite Salem–Spencer set is given by the [[Cube (algebra)|cubes]] ...

...dometric under which all data instances in the training set are surrounded by at least k instances that share the same class label. If this is achieved, ...rned metric causes the input vector <math>\vec x_i</math> to be surrounded by training instances of the same class. If it was a test point, it would be ...

...generalizations of [[integer partition]]s and [[plane partition]]s defined by [[Percy Alexander MacMahon]].<ref>{{cite book ...ons and their higher-dimensional generalizations are discussed in the book by [[George Andrews (mathematician)|Andrews]].<ref>{{cite book ...

Round-off is the loss of accuracy when numbers that differ by small amounts are subtracted. Because each number has only fifteen signific ...'010111000110010', representing a value of '1.1111111111117289E-4' rounded by Excel to 15&nbsp;significant digits: '1.11111111111173E-4'.]] ...

==By culture / time period== ...se) and a larger (base); an example is Roman numerals, which are organized by fives (V=5, L=50, D=500, the subbase) and tens (X=10, C=100, M=1,000, the b ...

...kernel moves across the input data. A stride of 1 means the kernel shifts by one pixel at a time, while a larger stride (e.g., 2 or 3) results in less o Common padding algorithms include: ...