Sign in for Members and Observers

IFIP WG1.3 Foundations of System Specification

Talk "Nawrotzki's Algorithm for the Countable Splitting Lemma, constructively"

by Ana Sokolova

Wed, 19 January 2022 at 10:30 am in Salzburg, Austria

Joint work with: Harald Woracek

Abstract: We reprove the countable splitting lemma by adapting Nawrotzki's algorithm which produces a sequence that converges to a solution. Our algorithm combines Nawrotzki's approach with taking finite cuts. It is constructive in the sense that each term of the iteratively built approximating sequence as well as the error between the approximants and the solution is computable with finitely many algebraic operations. This paper was published at CALCO 2021, and I gave this talk there. The talk will be short.