Matt Faunce <
mattf...@gmail.com> wrote:
> Here are the first two pages of The First Rule of Logic, by C. S. Peirce
>
> “Certain methods of mathematical computation correct themselves; so that if
> an error be committed, it is only necessary to keep right on, and it will
> be corrected in the end. For instance, I want to extract the cube root of
> 2. The true answer is 1.25992105… . The rule is as follows:
>
> “Form a column of numbers, which for the sake of brevity we may call the
> A’s. The first three A’s are any three numbers taken at will. To form a new
> A, add the last two A’s, triple the sum, add to this sum the last A but
> two, and set down the result as the next A. Now any A, the lower in the
> column the better, divided by the following A gives a fraction which
> increased by 1 is approximately [the cube root of two.]
>
> “You see the error committed in the second computation, though it seemed to
> multiply itself greatly, became substantially corrected in the end.
>
> “If you sit down to solve ten ordinary linear equations between ten unknown
> quantities, you will receive materials for a commentary upon the
> infallibility of mathematical processes. For you will almost infallibly get
> a wrong solution. I take it as a matter of course that you are not an
> expert professional computer. He will proceed according to a method which
> will correct his errors if he makes any.”
>
> [Because of the limitations of Usenet, Peirce’s table is re-represented by
> me, as follows:]
>
[Here’s the table again, but double spaced this time. (My crappy