Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra

Martin Ziegler. Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra. Annals of Pure and Applied Logic, 163(8):1108-1139, 2012. [doi]

@article{Ziegler12a,
  title = {Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra},
  author = {Martin Ziegler},
  year = {2012},
  doi = {10.1016/j.apal.2011.12.030},
  url = {http://dx.doi.org/10.1016/j.apal.2011.12.030},
  researchr = {https://researchr.org/publication/Ziegler12a},
  cites = {0},
  citedby = {0},
  journal = {Annals of Pure and Applied Logic},
  volume = {163},
  number = {8},
  pages = {1108-1139},
}