loading...
The Ordinal Recursive Complexity of Lossy Channel Systems
June 24-June 27
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2008.472008 23rd Annual IEEE Symposium on Lo ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
P. Chambart, P. Schnoebelen, "The Ordinal Recursive Complexity of Lossy Channel Systems," Logic in Computer Science, Symposium on, pp. 205-216, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2008.47,
author = {P. Chambart and P. Schnoebelen},
title = {The Ordinal Recursive Complexity of Lossy Channel Systems},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2008},
issn = {1043-6871},
pages = {205-216},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2008.47},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - The Ordinal Recursive Complexity of Lossy Channel Systems
SN - 1043-6871
SP205
EP216
A1 - P. Chambart,
A1 - P. Schnoebelen,
PY - 2008
KW - lossy channel systems
KW - complexity
KW - Fast-Growing Hierarchy
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
We show that reachability and termination for lossy channel systems is exactly at level F_omega^omega in the Fast-Growing Hierarchy of recursive functions, the first level that dominates all multiply-recursive functions.
Index Terms:
lossy channel systems, complexity, Fast-Growing Hierarchy
Citation:
P. Chambart, P. Schnoebelen, "The Ordinal Recursive Complexity of Lossy Channel Systems," lics, pp.205-216, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008
Usage of this product signifies your acceptance of the Terms of Use.