Abstract

This conference will revolve around several themes: the computational complexity of L-functions; statistical problems concerning L-functions, such as the distribution of their values, and zeros, moments of L-functions, statistics and size of ranks in families of elliptic curves; practical implementations of algorithms and their applications to testing various conjectures about L-functions; rigorous and certifiable computations of L-functions. One goal is to stimulate dialogue between theoreticians and computationally minded researchers regarding problems to which computation might provide insight or important confirmation of conjectures. In the other direction, we hope that discussions will lead to new ideas concerning algorithms for L-functions.