Search Results - "Recursive algorithmic complexity"

  • Showing 1 - 1 results of 1
Refine Results
  1. 1

    Algorithmic complexity as a criterion of unsolvability by Burgin, Mark

    ISSN: 0304-3975, 1879-2294
    Published: Amsterdam Elsevier B.V 18.09.2007
    Published in Theoretical computer science (18.09.2007)
    “…There is a dependency between computability of algorithmic complexity and decidability of different algorithmic problems. It is known that computability of the…”
    Get full text
    Journal Article Conference Proceeding