Showing 1 - 2 of 2

1

Algorithmic complexity as a criterion of unsolvability
BURGIN, Mark
Complexity of algorithms and computationsTheoretical computer science. 383(2-3):244-259

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences et techniques c... Sciences and techniques...
Conference
Save to List
2

Algorithmic complexity as a criterion of unsolvability
Mark Burgin
Theoretical Computer Science. 383:244-259

Recursive algorithmic co... Inductive Turing machine Super-recursive algorith... Kolmogorov complexity Algorithmic problem Inductive algorithmic co...
Academic journal
Save to List

Filter