BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Decision Problems for Linear Recurrence Sequences - Joel Ouaknine\
 , University of Oxford
DTSTART:20131129T160000Z
DTEND:20131129T170000Z
UID:TALK48673@talks.cam.ac.uk
CONTACT:Jonathan Hayman
DESCRIPTION:Linear recurrence sequences (such as the Fibonacci numbers)\np
 ermeate a vast number of areas of mathematics and computer science\n(in pa
 rticular: program termination and probabilistic verification)\,\nand also 
 have many applications in other fields such as economics\,\ntheoretical bi
 ology\, and statistical physics. In this talk\, I will\nfocus on three fun
 damental decision problems for linear recurrence\nsequences\, namely the S
 kolem Problem (does the sequence have a zero?)\,\nthe Positivity Problem (
 are all terms of the sequence positive?)\, and\nthe Ultimate Positivity Pr
 oblem (are all but finitely many terms of\nthe sequence positive?).
LOCATION:Room FW26\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR