Can everything be computed? - On the Solvability Complexity Index and Towers of Algorithms. Ben-Artzi, J., Hansen, A. C., Nevanlinna, O., & Seidel, M. CoRR, 2015.
Can everything be computed? - On the Solvability Complexity Index and Towers of Algorithms. [link]Link  Can everything be computed? - On the Solvability Complexity Index and Towers of Algorithms. [link]Paper  bibtex   
@article{journals/corr/Ben-ArtziHNS15,
  added-at = {2018-08-13T00:00:00.000+0200},
  author = {Ben-Artzi, Jonathan and Hansen, Anders C. and Nevanlinna, Olavi and Seidel, Markus},
  biburl = {https://www.bibsonomy.org/bibtex/228cd1399df6d170b5708b74ad04cd852/dblp},
  ee = {http://arxiv.org/abs/1508.03280},
  interhash = {62ae6805f94584a76a2467a64473f54d},
  intrahash = {28cd1399df6d170b5708b74ad04cd852},
  journal = {CoRR},
  keywords = {dblp},
  timestamp = {2018-08-14T12:31:18.000+0200},
  title = {Can everything be computed? - On the Solvability Complexity Index and Towers of Algorithms.},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr1508.html#Ben-ArtziHNS15},
  volume = {abs/1508.03280},
  year = 2015
}

Downloads: 0