This website uses technically necessary cookies to offer the best possible functionality.

Skip to Content Skip to Main Navigation Skip to Search

UnRAVeL – UNcertainty and Randomness in Algorithms, VErification and Logic

Guest Talk: Joël Ouaknine: The Skolem Landscape

Thursday, November 17, 2022, 11:00am

Location: RWTH Aachen University, Department of Computer Science - Ahornstr. 55, building E3, room 9222

Abstract:

The Skolem Problem asks how to determine algorithmically whether a given linear recurrence sequence (such as the Fibonacci numbers) has a zero. It is a central question in dynamical systems and number theory, and has many connections to other branches of mathematics and computer science. Unfortunately, the decidability of the Skolem Problem has been open for nearly a century! In this talk, I will present a survey of what is known on this problem and related questions, including recent and ongoing developments.

last updated : 06/01/2023