You are not currently logged in.
Access JSTOR through your library or other institution:
On the Complexity of Familiar Functions and Numbers
J. M. Borwein and P. B. Borwein
Vol. 30, No. 4 (Dec., 1988), pp. 589-601
Published by: Society for Industrial and Applied Mathematics
Stable URL: http://www.jstor.org/stable/2030559
Page Count: 13
Preview not available
This paper examines low-complexity approximations to familiar functions and numbers. The intent is to suggest that it is possible to base a taxonomy of such functions and numbers on their computational complexity. A central theme is that traditional methods of approximation are often very far from optimal, while good or optimal methods are often very far from obvious. For most functions, provably optimal methods are not known; however the gap between what is known and what is possible is often small. A considerable number of open problems are posed and a number of related examples are presented.
SIAM Review © 1988 Society for Industrial and Applied Mathematics