line 9, righthand side should be $\ln\ln N+\sum{c_k\over(\ln N)^k}$.
line 10, $a_1=\gamma-1$
line 11, $a_k=(k-1)!\Bigl({\gamma_0\over0!}+\cdots+{\gamma_{k-1}\over(k-1)!}
-1$
line -5 should say just 'also'
line -3 should say '$\gamma$' instead of '$3\gamma$'

*page 366, line 4 from the bottom

change '$f_n$' to '$d_n$'

page 372, line 1

change '])' to ']'

page 380, line 6

insert closing quotes after the second comma

*page 380, line 6 from the bottom

change '$o(1)$' to '$o(n^{1/2})$'

page 381, lines 8 and 9

change '$=$' to '$\sim$'

page 382, line 5 from the bottom

the first left parenthesis should be larger

*page 382, line 5 from the bottom

change '(-1)' to '(1)'

page 383, bottom line

change '$=$' to '$\sim$'

page 384, lines 5 and 6 from the bottom

change 'know the asymptotic value' to 'know the value'

page 388, line 4 from the bottom

change '$=$' to '$\sim$'

*page 399, line 10 from the bottom

change '$A(a,1,0)$' to '$A(a,1)$'

*page 402, line 6 from the bottom

change '$C(z)^k$' to '$C(z)^n$

*page 403, line 4

change '$x\ge y$' to '$x\le y$'

*page 410, replacement for lines 15 and 16

else if $x_1>x_2+1=x_3+2$ then max$(x_3,x_j)$else $g_{j-1}(x_2,\ldots,x_j)$
[Also delete the footnote on this page.]

The author's original formulation of Theorem 4 was incorrect, but a
correct definition of the function $g_j(x_1,\ldots,x_j)$ was found in
May 2000 by Thomas A. Bailey as he was working with John R. Cowles on
Open Problem 4. As of June 2000, ACL2 has verified the corrected
version of Theorem 4 when $2\le m\le 7$.

page 466, line 3 from the bottom

change ', to appear, apply' to '47 (2000), 905--911, have applied'

page 469, line 9

change 'p_{nk}z^k' to 'p_{nk}z^n'

page 478, line 15

change ').' to ')'

page 500, last three lines

change 'But the optimum procedure for sorting 13, 14,' to
'Marcin Peczarski [ESA 2002, to appear] extended Wells's method to prove that
merge is actually unbeatable when $n=13$. But the optimum procedure for
sorting 14,'

page 502, line 2

change 'of of' to 'of'

page 503, line 7 from the bottom

change 'Intermèdiaire' to
'Intermédiaire'

page 504, new copy to follow the references

Addendum Strictly speaking, an addition chain should specify
the sets of integers $\{j(i,q) \mid 1\le q\le r(i)\}$ as well as the sequence
of vectors $C$, because the latter does not uniquely define the former.

change 'is traditionally known as' to 'was in fact defined and named by
J. L. Carter in his Ph.D. dissertation, On the Existence of a Projective Plane of Order Ten (Berkeley, California: Mathematics Department,
University of California, 1974). It is also known as the problem of'

page 551, line 13

change '$(.11001\ldots{})$' to '$(.11001\ldots{})_2$'

*page 556, line 13 from the bottom

change 'transcendental' to 'irrational'

*page 557, line 3 from the bottom

change '$\mu\ge0$' to '$\mu>m$'

*page 557, line 2 from the bottom

change '$\sum_{m=0}^\mu$' to '$\sum_{m=0}^{\mu-1}$'

*page 581, line 9 from the bottom

change '$F_{j+1}$' to '${1\over2}F_{j+1}$'

*page 582, line 21

change '(5.24)' to '(5.25)'

page 602, line 5

change '1286-1291' to '1286--1291'

*page 603, new paragraph to follow line 8

Conversely, if $F(x)$ is a polynomial distribution with rational
coefficients for which $F'(x)$ has no irrational roots, Guy Kindler
and Dan Romik have shown that $F(x)$ can be generated by an fsg;
this completes the solution of problem (v). [``On distributions
computable by random walks on graphs,'' SIAM Journal on Discrete
Mathematics17 (2004), 624--633.]