ABSTRACT
Far better an approximate answer to the right question, which is often vague, than an exact answer to the wrong question, which can always be made precise. One of the most difficult open problems is to determine a fast algorithm to compute the n-th prime number. An almost equivalent problem is to determine the number of prime numbers less than n with a fast algorithm. In the same way, Ramsey’s theorem raises problems with known methods of resolution. But these methods of resolution all require unreasonable calculations. One might think that these infinite calculations are useless. Well, actually, they are ubiquitous in the preliminary models of applied mathematics, for example in the equations of fluid dynamics. While approximating numbers like t with great precision is of only limited interest, approximating curves, functions, and physical, biological, or mathematical behaviors has a very wide range of applications.
