# Algorithmic decidability of equality in the ring of periods

Suppose two elements of the ring of periods are given by their systems of polynomial inequalities with rational coefficients. Is there a known algorithm deciding their equality? Is it known if their equality is algorithmically decidable at all?

It is quite obvious that if they are not equal, then it can be shown after finite number of steps just by evaluating them with big enough precision. The difficult part is when they are equal.

-
There is a deep conjecture here which is explained nicely in the paper of Kontsevich-Zagier. –  Moosbrugger Dec 8 '11 at 22:05
This is Problem 1 of Kontsevich-Zagier. They say: "Problem 1 therefore looks completely intratable now and may remain so for many years" (page 7). ihes.fr/~maxim/TEXTS/Periods.pdf –  François G. Dorais Dec 9 '11 at 4:02