## Talks by Peter Borwein

36:
Zeros and Poles

35: The Riemann Hypothesis

34: Littlewood's 22nd Problem

33: Problems Somewhere Between ...

32: A Problem of Smale

31: A Theorem of Duffin and Schaeffer

30: The Million Dollar Prizes

29: The Measure of Littlewood Polynomials 2

28: The Measure of Littlewood Polynomials 1

27: Three Highly Computational Problems

26: RevEng

25: A Collection of Open Problems

24: The Average Norm of Polynomials

23: Monic Integer Cheyshev Problem

22: The Amazing Number Pi (large file)

21: The Unreasonable Efficacy of Symbolic Computation

20: Small Norm Problems of Erdos-Littlewood Type

19: Computations on Pisot Numbers

18: The Quadrillionth Binary Digit of Pi is 0

17: COGNOS Lecture: 2000

16: Erdos and Polynomials: 1999

15: Vignettes involving Rational Functions

14: ECCAD

13: Merit Factor Problems

12: The Nature of Mathematics

11: Polynomials with Integer Coefficients and Small Norm

10: Littlewood Type Problems on Subarcs

9: Prouhet, Tarry, Escott revisited

8: Mathematics on Mainstreet

7: Frontier's Lecture : Some Old Problems on Polynomials with integer Coefficients:

6: Incomplete Rationals

5: A Sharp Bernstein-Type inequality for Exponential Sums

4: A Very Simple Class of Algorithms for the Riemann-Zeta Function

3: Müntz Polynomials

2: Some Distinctive Inequalities

1: On the Computation of Pi