Kolmogorov complexity for possibly infinite computations. Becher, V. & Figueira, S. J. Log. Lang. Inf., 14(2):133–148, 2005.
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
{"_id":"Yfu5zwQ8ms7Hv5fRT","bibbaseid":"becher-figueira-kolmogorovcomplexityforpossiblyinfinitecomputations-2005","downloads":0,"creationDate":"2018-10-05T11:34:49.492Z","title":"Kolmogorov complexity for possibly infinite computations","author_short":["Becher, V.","Figueira, S."],"year":2005,"bibtype":"article","biburl":"http://cca-net.de/publications/lit.bib","bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Becher"],"firstnames":["Verónica"],"suffixes":[]},{"propositions":[],"lastnames":["Figueira"],"firstnames":["Santiago"],"suffixes":[]}],"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","bibtex":"@ARTICLE{BF05,\r\n author = {Becher, Ver{\\'o}nica and Figueira, Santiago},\r\n title = {Kolmogorov complexity for possibly infinite computations},\r\n journal = {J. Log. Lang. Inf.},\r\n year = {2005},\r\n volume = {14},\r\n pages = {133--148},\r\n number = {2},\r\n doi = {10.1007/s10849-005-2255-6},\r\n fjournal = {Journal of Logic, Language and Information},\r\n issn = {0925-8531},\r\n keywords = {bib,cca},\r\n mrclass = {68Q30 (03D15 68Q15)},\r\n mrnumber = {2137455 (2006j:68049)},\r\n mrreviewer = {John P. Helm},\r\n owner = {Vasco},\r\n timestamp = {2013.12.01},\r\n url = {http://dx.doi.org/10.1007/s10849-005-2255-6}\r\n}\r\n\r\n","author_short":["Becher, V.","Figueira, S."],"key":"BF05","id":"BF05","bibbaseid":"becher-figueira-kolmogorovcomplexityforpossiblyinfinitecomputations-2005","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/s10849-005-2255-6"},"keyword":["bib","cca"],"downloads":0},"search_terms":["kolmogorov","complexity","possibly","infinite","computations","becher","figueira"],"keywords":["bib","cca"],"authorIDs":[],"dataSources":["t7rKiAbxugj4Agz8M"]}