Search Results for ""

Any computable function can be incorporated into a program using while-loops (i.e., "while something is true, do something else"). For-loops (which have a fixed iteration ...

A number which can be computed to any number of digits desired by a Turing machine. Surprisingly, most irrationals are not computable numbers!

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 ...

Does there exist an algorithm for deciding whether or not a specific mathematical assertion does or does not have a proof? The decision problem is also known as the ...

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 ...

A matrix H with elements H_(ij)=(i+j-1)^(-1) (1) for i,j=1, 2, ..., n. Hilbert matrices are implemented in the Wolfram Language by HilbertMatrix[m, n]. The figure above shows ...

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, ...