References

  1. Vasco Brattka (2005): Effective Borel measurability and reducibility of functions. Mathematical Logic Quarterly 51(1), pp. 19–44, doi:10.1002/malq.200310125.
  2. Vasco Brattka, Matthew de Brecht & Arno Pauly (2012): Closed Choice and a Uniform Low Basis Theorem. Annals of Pure and Applied Logic 163(8), pp. 968–1008, doi:10.1016/j.apal.2011.12.020.
  3. Vasco Brattka & Guido Gherardi (2011): Effective Choice and Boundedness Principles in Computable Analysis. Bulletin of Symbolic Logic 1, pp. 73 – 117, doi:10.2178/bsl/1294186663.
  4. Vasco Brattka & Guido Gherardi (2011): Weihrauch Degrees, Omniscience Principles and Weak Computability. Journal of Symbolic Logic 76, pp. 143 – 176, doi:10.2178/jsl/1294170993.
  5. Vasco Brattka, Guido Gherardi & Alberto Marcone (2012): The Bolzano-Weierstrass Theorem is the Jump of Weak König's Lemma. Annals of Pure and Applied Logic 163(6), pp. 623–625, doi:10.1016/j.apal.2011.10.006.
  6. Vasco Brattka & Arno Pauly (2010): Computation with Advice. In: Xizhong Zheng & Ning Zhong: Proceedings Seventh International Conference on Computability and Complexity in Analysis, Electronic Proceedings in Theoretical Computer Science 24, pp. 41–55, doi:10.4204/EPTCS.24.9.
  7. Matthew de Brecht & Akihiro Yamamoto (2009): Σ^0_α-Admissible Representations (Extended Abstract). In: Andrej Bauer, Peter Hertling & Ker-I Ko: Sixth International Conference on Computability and Complexity in Analysis, CCA 2009, August 18-22, 2009, Ljubljana, Slovenia, Open Access Series in Informatics 11. Schloss Dagstuhl, pp. 119–130, doi:10.4230/OASIcs.CCA.2009.2264.
  8. Stefano Galatolo, Mathieu Hoyrup & Christobal Robas (2011): Dynamics and abstract computability: computing invariant measures. Discrete and Continuous Dynamical Systems 29(1), pp. 193–212, doi:10.3934/dcds.2011.29.193.
  9. Guido Gherardi & Alberto Marcone (2009): How incomputable is the separable Hahn-Banach theorem?. Notre Dame Journal of Formal Logic 50(4), pp. 393–425, doi:10.1215/00294527-2009-018.
  10. Joel David Hamkins & Andy Lewis (2000): Infinite Time Turing Machines. Journal of Symbolic Logic 65(2), pp. 567–604, doi:10.2307/2586556.
  11. Kojiro Higuchi & Takayuki Kihara: Inside the Muchnik Degrees: Discontinuity, Learnability, and Constructivism. preprint.
  12. Kojiro Higuchi & Arno Pauly (2013): The degree-structure of Weihrauch-reducibility. Logical Methods in Computer Science 9(2), doi:10.2168/LMCS-9(2:2)2013.
  13. J. E. Jayne & C. A. Rogers (1984): Piece-wise closed functions. Mathematische Annalen 255, pp. 499–518, doi:10.1007/BF01451930.
  14. J.E. Jayne & C.A. Rogers (1982): First level Borel functions and isomorphisms. Journal de Mathématiques Pures et Appliquées 61, pp. 177–205.
  15. Miroslav Kačena, Luca Motto Ros & Brian Semmes (2012): Some observations on 'A New Proof of a Theorem of Jayne and Rogers'. Real Analysis Exchange 38(1), pp. 121–132.
  16. Alexander S. Kechris (1995): Classical Descriptive Set Theory. Graduate Texts in Mathematics 156. Springer, doi:10.1007/978-1-4612-4190-4.
  17. Luca Motto Ros (2011): Game representations of classes of piecewise definable functions. Mathematical Logic Quarterly 57(1), pp. 95–112, doi:10.1002/malq.200910124.
  18. Luca Motto Ros & Brian Semmes (2009): A New Proof of a Theorem of Jayne and Rogers. Real Analysis Exchange 35(1), pp. 195–204.
  19. Arno Pauly (2009): Infinite Oracle Queries in Type-2 Machines (Extended Abstract). arXiv:0907.3230v1.
  20. Arno Pauly (2010): How Incomputable is Finding Nash Equilibria?. Journal of Universal Computer Science 16(18), pp. 2686–2710, doi:10.3217/jucs-016-18-2686.
  21. Arno Pauly (2010): On the (semi)lattices induced by continuous reducibilities. Mathematical Logic Quarterly 56(5), pp. 488–502, doi:10.1002/malq.200910104.
  22. Arno Pauly (2012): Compactness and Separation for Represented Spaces. http://arxiv.org/abs/1204.3763.
  23. Arno Pauly (2012): Computable Metamathematics and its Application to Game Theory. University of Cambridge.
  24. Robert Rettinger (2011): Compactness and the Effectivity of Uniformization. Talk at CCA 2011.
  25. Matthias Schröder (2002): Extended admissibility. Theoretical Computer Science 284(2), pp. 519–538, doi:10.1016/S0304-3975(01)00109-8.
  26. Brian Semmes (2009): A Game for the Borel Functions. University of Amsterdam.
  27. S. Solecki (1998): Decomposing Borel sets and functions and the structure of Baire class 1 functions. Journal of the American Mathematical Society 11(3), pp. 521–550, doi:10.1090/S0894-0347-98-00269-0.
  28. Nazanin Tavana & Klaus Weihrauch (2011): Turing machines on represented sets, a model of computation for analysis. Logical Methods in Computer Science 7, pp. 1–21, doi:10.2168/LMCS-7(2:19)2011.
  29. William W. Wadge (1972): Degrees of complexity of subsets of the Baire space. Notices of the American Mathematical Society, pp. 714–715.
  30. Klaus Weihrauch (1992): The degrees of discontinuity of some translators between representations of the real numbers. Informatik Berichte 129. FernUniversität Hagen, Hagen.
  31. Klaus Weihrauch (1992): The TTE-interpretation of three hierarchies of omniscience principles. Informatik Berichte 130. FernUniversität Hagen, Hagen.
  32. Klaus Weihrauch (2000): Computable Analysis. An Introduction. Texts in Theoretical Computer Science. Springer-Verlag, doi:10.1007/978-3-642-56999-9.
  33. Martin Ziegler (2005): Computability and continuity on the real arithmetic hierarchy and the power of type-2 nondeterminism. In: Barry S. Cooper, Benedikt Löwe & Leen Torenvliet: New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings, Lecture Notes in Computer Science 3526. Springer, pp. 562–571, doi:10.1007/11494645_68.
  34. Martin Ziegler (2007): Real Hypercomputation and Continuity. Theory of Computing Systems 41, pp. 177 – 206, doi:10.1007/s00224-006-1343-6.
  35. Martin Ziegler (2007): Revising Type-2 Computation and Degrees of Discontinuity. Electronic Notes in Theoretical Computer Science 167, pp. 255–274, doi:10.1016/j.entcs.2006.08.015.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org