The Ordinal Recursive Complexity of Lossy Channel Systems

13 years 11 months ago

Download www.lsv.ens-cachan.fr

We show that reachability and termination for lossy channel systems is exactly at level Fωω in the Fast-Growing Hierarchy of recursive functions, the ﬁrst level that dominates all multiply-recursive functions.

Pierre Chambart, Ph. Schnoebelen

Real-time Traffic

Computer Science | LICS 2008 | Lossy Channel Systems | Recursive Functions | ﬁrst Level |

claim paper

» Post Embedding Problem Is Not Primitive Recursive with Applications to Channel Systems

» Proofs Programs and Abstract Complexity

» Temporal Logics over Transitive States

» Blind Deconvolution of SISO Systems with Binary Source Based on Recursive Channel Shorteni...

» Nets with Tokens Which Carry Data

» Compressive tracking of doubly selective channels in multicarrier systems based on sequent...

» LowComplexity Adaptive HighResolution Channel Prediction for OFDM Systems

» Network Estimation and Packet Delivery Prediction for Control over Wireless Mesh Networks

Post Info
More Details (n/a)

Added	31 May 2010
Updated	31 May 2010
Type	Conference
Year	2008
Where	LICS
Authors	Pierre Chambart, Ph. Schnoebelen

Comments (0)

Sciweavers

The Ordinal Recursive Complexity of Lossy Channel Systems

Computer Science | LICS 2008 | Lossy Channel Systems | Recursive Functions | ﬁrst Level |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers