47 citations · 183 across the 23 of their papers we have counts for
1 paper · 2 filters
Benjamin Lucien Kaminski, Joost-Pieter Katoen
This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost-sure termination of probabilistic programs. It is shown th…