Can everything be computed? - On the Solvability Complexity Index and Towers of Algorithms.
Jonathan Ben-ArtziAnders C. HansenOlavi NevanlinnaMarkus SeidelPublished in: CoRR (2015)
Keyphrases
- computational complexity
- computational cost
- worst case
- recently developed
- lower complexity
- memory requirements
- orders of magnitude
- index structure
- computationally efficient
- data structure
- database systems
- learning algorithm
- computational issues
- high computational complexity
- data mining
- space complexity
- indexing techniques
- times faster
- computational efficiency
- benchmark datasets
- optimization problems
- reinforcement learning