TOPICS
Search

Search Results for ""


61 - 70 of 157 for Turing MachineSearch Results
Some interesting properties (as well as a few arcane ones not reiterated here) of the number 239 are discussed in Schroeppel (1972). 239 appears in Machin's formula ...
If one root of the equation f(x)=0, which is irreducible over a field K, is also a root of the equation F(x)=0 in K, then all the roots of the irreducible equation f(x)=0 are ...
Let V be a vector space over a field K, and let A be a nonempty set. Now define addition p+a in A for any vector a in V and element p in A subject to the conditions: 1. ...
A Gaussian quadrature-like formula over the interval [-1,1] which has weighting function W(x)=x. The general formula is int_(-1)^1xf(x)dx=sum_(i=1)^nw_i[f(x_i)-f(-x_i)]. n ...
A computation is an operation that begins with some initial conditions and gives an output which follows from a definite set of rules. The most common example are ...
An elliptic curve is the set of solutions to an equation of the form y^2+a_1xy+a_3y=x^3+a_2x^2+a_4x+a_6. (1) By changing variables, y->2y+a_1x+a_3, assuming the field ...
A surface of revolution which is generalization of the ring torus. It is produced by rotating an ellipse having horizontal semi-axis a, vertical semi-axis b, embedded in the ...
Fisheye perspective is a two-part projection. First, three-dimensional space is projected onto the surface of a hemisphere, by connecting every external point to the center ...
A root-finding algorithm which makes use of a third-order Taylor series f(x)=f(x_n)+f^'(x_n)(x-x_n)+1/2f^('')(x_n)(x-x_n)^2+.... (1) A root of f(x) satisfies f(x)=0, so 0 ...
The numbers defined by the recurrence relation K_(n+1)=1+min(2K_(|_n/2_|),3K_(|_n/3_|)), with K_0=1. The first few values for n=0, 1, 2, ... are 1, 3, 3, 4, 7, 7, 7, 9, 9, ...
1 ... 4|5|6|7|8|9|10 ... 16 Previous Next

...