Search Results - "Recursive algorithmic complexity"

Algorithmic complexity as a criterion of unsolvability

Authors: Mark Burgin

Source: Theoretical Computer Science. 383:244-259

Subject Terms: Recursive algorithmic complexity, Inductive Turing machine, Super-recursive algorithm, Kolmogorov complexity, Algorithmic problem, Inductive algorithmic complexity, Decidability, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Access URL: https://core.ac.uk/display/82482743
https://www.sciencedirect.com/science/article/pii/S0304397507003209
https://dblp.uni-trier.de/db/journals/tcs/tcs383.html#Burgin07