Mark Burgin. Algorithmic complexity as a criterion of unsolvability. Theoretical Computer Science, 383(2-3):244-259, 2007. [doi]
@article{Burgin07:2,
title = {Algorithmic complexity as a criterion of unsolvability},
author = {Mark Burgin},
year = {2007},
doi = {10.1016/j.tcs.2007.04.011},
url = {http://dx.doi.org/10.1016/j.tcs.2007.04.011},
researchr = {https://researchr.org/publication/Burgin07%3A2},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {383},
number = {2-3},
pages = {244-259},
}