Verónica Becher, Santiago Figueira, André Nies, Silvana Picchi. Program Size Complexity for Possibly Infinite Computations. Notre Dame Journal of Formal Logic, 46(1):51-64, 2005. [doi]
@article{BecherFNP05,
title = {Program Size Complexity for Possibly Infinite Computations},
author = {Verónica Becher and Santiago Figueira and André Nies and Silvana Picchi},
year = {2005},
url = {http://projecteuclid.org/euclid.ndjfl/1107220673},
researchr = {https://researchr.org/publication/BecherFNP05},
cites = {0},
citedby = {0},
journal = {Notre Dame Journal of Formal Logic},
volume = {46},
number = {1},
pages = {51-64},
}