**18 June, 2012, 2PM, room
119, Michael Atiyah Building.**

A famous mathematician, Yuri Matiyasevich, will visit us and give
a talk.

Yurii Matiyasevich is
best known for his negative solution of Hilbert's tenth problem: He proved that
there is no algorithm which can solve all Diophantine equations. More
information about his achievements and awards you can find in http://en.wikipedia.org/wiki/Yuri_Matiyasevich .

Yuri Matiyasevich will talk about zeros of Riemann's zeta
function, the conjecture which belongs to the so-called "Millennium
problems". These are seven problems in mathematics that were selected by
the Clay Mathematics Institute in 2000 as the most important unsolved
mathematical problems. As of June 2012, six of the problems remain unsolved. A
correct solution to any of the problems results in a US$1,000,000 prize
(sometimes called a Millennium Prize)

The talk will be interesting for both pure and applied
mathematicians; it will also be understandable for PhD students and include
enough introductory and review material.

**New conjectures about zeros of Riemann's
zeta function**

Abstract: the
speaker described a surprising method for (approximate) calculation of the
zeros of Riemann's zeta function using terms of the divergent Dirichlet series.
In the talk this method will be presented together with some heuristic hints
explaining why the divergence of the series doesn't spoil its use. Several
conjectures about the zeros of Riemann's zeta function will be stated including
supposed new relationship between them and the prime numbers.

More details are on the personal homepage: *An
artless method for calculating approximate values of zeros of Riemann's zeta
function found by Yuri Matiyasevich*

The slides of
the talk (pdf) are here: **New Conjectures about
Zeroes of Riemann’s Zeta Function
(presentation)**

The paper with
more explanations is here **New Conjectures about Zeroes of Riemann's Zeta Function (preprint)**

The brief leaflet prepared by some of the audience after the
lecture: **Supercomputing for Superproblem: a computational
travel in pure mathematics**