Tenacity, Mathematics

The Eddington machine would be the universal supercomputer. It would be made of all the atoms in the universe. The Eddington machine would contain ten vigintsextillion parts, and if the Chudnovsky brothers could figure out how to program it with fortran they might make it churn toward pi.

“In order to study the sequence of pi, you have to store it in the Eddington machine’s memory,” Gregory said. To be realistic, the brothers thought that a practical Eddington machine wouldn’t be able to store pi much beyond 1077 digits—a number that is only a hundredth of the Eddington number. Now, what if the digits of pi only begin to show regularity beyond 10 digits?

Suppose, for example, that pi manifests a regularity starting at 10100 decimal places? That number is known as a googol. If the design in pi appears only after a googol of digits, then not even the Eddington machine will see any system in pi; pi will look totally disordered to the universe, even if pi contains a slow, vast, delicate structure. A mere googol of pi might be only the first knot at the corner of a kind of limitless Persian rug, which is woven into increasingly elaborate diamonds, cross-stars, gardens, and cosmogonies. It may never be possible, in principle, to see the order in the digits of pi. Not even nature itself may know the nature of pi.

“If pi doesn’t show systematic behavior until more than ten to the seventy-seven decimal places, it would really be a disaster,” Gregory said. “It would be actually horrifying.”

“I wouldn’t give up,” David said. “There might be some other way of leaping over the barrier—”

“And of attacking the son of a bitch,” Gregory said.

— Richard Preston, The Mountains of Pi