Search Results for ""

Let P be the principal (initial investment), r be the annual compounded rate, i^((n)) the "nominal rate," n be the number of times interest is compounded per year (i.e., the ...

Let L be a link in R^3 and let there be a disk D in the link complement R^3-L. Then a surface F such that D intersects F exactly in its boundary and its boundary does not ...

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

Computation time (also called "running time") is the length of time required to perform a computational process. Representation a computation as a sequence of rule ...

The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...

While many computations admit shortcuts that allow them to be performed more rapidly, others cannot be sped up. Computations that cannot be sped up by means of any shortcut ...

Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number ...

The computational paradigm is a term introduced by Wolfram (2002, 2021) to describe the idea of using simple programs rather than mathematical equations (the latter of which ...