Kolmogorov complexity for possibly infinite computations. Becher, V. & Figueira, S. J. Log. Lang. Inf., 14(2):133–148, 2005.
Kolmogorov complexity for possibly infinite computations [link]Paper  doi  bibtex   
@ARTICLE{BF05,
  author = {Becher, Ver{\'o}nica and Figueira, Santiago},
  title = {Kolmogorov complexity for possibly infinite computations},
  journal = {J. Log. Lang. Inf.},
  year = {2005},
  volume = {14},
  pages = {133--148},
  number = {2},
  doi = {10.1007/s10849-005-2255-6},
  fjournal = {Journal of Logic, Language and Information},
  issn = {0925-8531},
  keywords = {bib,cca},
  mrclass = {68Q30 (03D15 68Q15)},
  mrnumber = {2137455 (2006j:68049)},
  mrreviewer = {John P. Helm},
  owner = {Vasco},
  timestamp = {2013.12.01},
  url = {http://dx.doi.org/10.1007/s10849-005-2255-6}
}

Downloads: 0