**
*Dear all,*
*
On Tuesday January 25th, Aart Middeldorp (University of Innsbruck, Austria) will give a talk, Polynomial Termination over N is Undecidable, for our project colloquium from 16:30. Further details can be found below.
If you would like to attend, please register through the following Google form:
https://forms.gle/6PoGNEfJVHLYDAdKA https://forms.gle/6PoGNEfJVHLYDAdKA
We later send you a zoom link by an email (using BCC).
For the latest information about ERATO colloquium / seminar, please see the webpage https://docs.google.com/document/d/1Qrg4c8XDkbO3tmns6tQwxn5lGHOrBON5LtHXXTpX... .
Jérémy Dubut (ERATO MMSD Colloquium Organizer)
Email: [email protected]
-------Tuesday January 25th, 16:30-18:00
Speaker: *Aart Middeldorp (University of Innsbruck, Austria)*
**
Title: *Polynomial Termination over N is Undecidable*
Abstract: Using the undecidability of Hilbert's 10th problem, we present three different proofs of the undecidability of the problem whether the termination of a given rewrite system can be shown by a polynomial interpretation in the natural numbers. The talk is based on joint work with Fabian Mitterwallner.
*