BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Joost-Pieter Katoen (RWTH Aachen University)
DTSTART:20200415T130000Z
DTEND:20200415T140000Z
DTSTAMP:20260423T021122Z
UID:OWLS/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OWLS/1/">Ter
 mination of probabilistic programs</a>\nby Joost-Pieter Katoen (RWTH Aache
 n University) as part of Online Worldwide Seminar on Logic and Semantics (
 OWLS)\n\n\nAbstract\nProgram termination is a key question in program veri
 fication. This talk considers the termination of probabilistic programs\, 
 programs that can describe randomised algorithms and more recently receive
 d attention in machine learning. Probabilistic termination has several nua
 nces and has some unexpected effects. Programs may diverge with zero proba
 bility\; they almost-surely terminate (AST). Two AST-programs run in seque
 nce may have an infinite expected run-time\, though each of its constituen
 ts has a finite expected run-time.\n\nThis talk will demystify the notions
  of probabilistic termination\, its surprising effects\, and its hardness 
 ("degree of undecidability"). We will show a simple proof rule for decidin
 g AST.\n
LOCATION:https://researchseminars.org/talk/OWLS/1/
END:VEVENT
END:VCALENDAR