Algorithmic Problems for Recurrence Sequences (Ben WORELL, University of Oxford)

Recurrence sequences arise across mathematics and theoretical computer science and some of their most basic properties lead to surprisingly difficult algorithmic questions. For example: given a sequence of rational numbers defined by a linear recurrence…

Conseil Général 7-9 / Salle 1-15, Colloque de mathématiques