Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability

DOI10.4230/OASIcs.CCA.2009.2277zbMath1247.03106arXiv0811.3782MaRDI QIDQ2917350

Martin Ziegler

Publication date: 28 September 2012

Full work available at URL: https://arxiv.org/abs/0811.3782

zbMATH Keywords

topological complexity; linear algebra; recursive analysis; nonuniform computability

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

65F99: Numerical linear algebra

03D78: Computation over the reals, computable analysis