VerĂ³nica Becher, Santiago Figueira. Kolmogorov Complexity for Possibly Infinite Computations. Journal of Logic, Language and Information, 14(2):133-148, 2005. [doi]
@article{BecherF05, title = {Kolmogorov Complexity for Possibly Infinite Computations}, author = {VerĂ³nica Becher and Santiago Figueira}, year = {2005}, doi = {10.1007/s10849-005-2255-6}, url = {http://dx.doi.org/10.1007/s10849-005-2255-6}, tags = {Kolmogorov complexity}, researchr = {https://researchr.org/publication/BecherF05}, cites = {0}, citedby = {0}, journal = {Journal of Logic, Language and Information}, volume = {14}, number = {2}, pages = {133-148}, }