Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Kolmogorov Complexity for Possibly Infinite ComputationsVerónica Becher, Santiago Figueira. jolli, 14(2):133-148, 2005. [doi]
The following publications are possibly variants of this publication: