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.
Mark Burgin. Algorithmic complexity as a criterion of unsolvability. Theoretical Computer Science, 383(2-3):244-259, 2007. [doi]
No references recorded for this publication.
No citations of this publication recorded.