The Ordinal Recursive Complexity of Lossy Channel Systems

Pierre Chambart, Ph. Schnoebelen · Proceedings - Symposium on Logic in Computer Science · 2008

We show that reachability and termination for lossy channel systems is exactly at level Fomegaomega in the fast-growing hierarchy of recursive functions, the first level that dominates all multiply-recursive functions.

Read the paper · More papers on PaperTik