@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
}

{"_id":"5nLEWzKwND6ezXj4v","bibbaseid":"benartzi-hansen-nevanlinna-seidel-caneverythingbecomputedonthesolvabilitycomplexityindexandtowersofalgorithms-2015","authorIDs":[],"author_short":["Ben-Artzi, J.","Hansen, A. C.","Nevanlinna, O.","Seidel, M."],"bibdata":{"bibtype":"article","type":"article","added-at":"2018-08-13T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Ben-Artzi"],"firstnames":["Jonathan"],"suffixes":[]},{"propositions":[],"lastnames":["Hansen"],"firstnames":["Anders","C."],"suffixes":[]},{"propositions":[],"lastnames":["Nevanlinna"],"firstnames":["Olavi"],"suffixes":[]},{"propositions":[],"lastnames":["Seidel"],"firstnames":["Markus"],"suffixes":[]}],"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","bibtex":"@article{journals/corr/Ben-ArtziHNS15,\n added-at = {2018-08-13T00:00:00.000+0200},\n author = {Ben-Artzi, Jonathan and Hansen, Anders C. and Nevanlinna, Olavi and Seidel, Markus},\n biburl = {https://www.bibsonomy.org/bibtex/228cd1399df6d170b5708b74ad04cd852/dblp},\n ee = {http://arxiv.org/abs/1508.03280},\n interhash = {62ae6805f94584a76a2467a64473f54d},\n intrahash = {28cd1399df6d170b5708b74ad04cd852},\n journal = {CoRR},\n keywords = {dblp},\n timestamp = {2018-08-14T12:31:18.000+0200},\n title = {Can everything be computed? - On the Solvability Complexity Index and Towers of Algorithms.},\n url = {http://dblp.uni-trier.de/db/journals/corr/corr1508.html#Ben-ArtziHNS15},\n volume = {abs/1508.03280},\n year = 2015\n}\n\n","author_short":["Ben-Artzi, J.","Hansen, A. C.","Nevanlinna, O.","Seidel, M."],"key":"journals/corr/Ben-ArtziHNS15","id":"journals/corr/Ben-ArtziHNS15","bibbaseid":"benartzi-hansen-nevanlinna-seidel-caneverythingbecomputedonthesolvabilitycomplexityindexandtowersofalgorithms-2015","role":"author","urls":{"Link":"http://arxiv.org/abs/1508.03280","Paper":"http://dblp.uni-trier.de/db/journals/corr/corr1508.html#Ben-ArtziHNS15"},"keyword":["dblp"],"downloads":0},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/artzi?items=1000","creationDate":"2020-07-22T18:55:46.072Z","downloads":0,"keywords":["dblp"],"search_terms":["everything","computed","solvability","complexity","index","towers","algorithms","ben-artzi","hansen","nevanlinna","seidel"],"title":"Can everything be computed? - On the Solvability Complexity Index and Towers of Algorithms.","year":2015,"dataSources":["JpdK2X3JPZrrRHChh"]}