|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Decision Problems for Linear Recurrence Sequences
If you have a question about this talk, please contact Jonathan Hayman.
Linear recurrence sequences (such as the Fibonacci numbers) permeate a vast number of areas of mathematics and computer science (in particular: program termination and probabilistic verification), and also have many applications in other fields such as economics, theoretical biology, and statistical physics. In this talk, I will focus on three fundamental decision problems for linear recurrence sequences, namely the Skolem Problem (does the sequence have a zero?), the Positivity Problem (are all terms of the sequence positive?), and the Ultimate Positivity Problem (are all but finitely many terms of the sequence positive?).
This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsQuastel Midgen LLP Presentation Seven Types of Forgetting Department of History and Philosophy of Science
Other talksMeasuring everything everywhere: the Global Burden of Disease study and its use by Public Health England Personal Data Stores the Route to Data Independence, Portability, Trust and Seamless Services The evolution of arthropod small RNA pathways Conductive Inks, Fibers And Aerogels From Graphite Microfluidization Dr Frank Waldron-Lynch: Immune Cell Responses in Participants with Type 1 Diabetes after doses of Interleukin-2 in adaptive-response clinical trials Electron cryomicroscopy of biological structures: overcoming the barriers to further progress.