Algorithmic complexity as a criterion of unsolvability

Mark Burgin. Algorithmic complexity as a criterion of unsolvability. Theoretical Computer Science, 383(2-3):244-259, 2007. [doi]

Authors

Mark Burgin

This author has not been identified. Look up 'Mark Burgin' in Google