Brattka, Vasco, Loops, Inverse Limits and Non-Determinism, arXiv arXiv:2501.17734 (2025)
Brattka, Vasco and Rauzy, Emmanuel, Effective second countability in computable analysis, in: Beckmann, Arnold and Oitavem, Isabel and Manea, Florin (eds.), Crossroads of Computability and Logic: Insights, Inspirations, and Innovations, vol. 15764 of Lecture Notes in Computer Science, Springer, Cham, 2025, pages 19-33
Brattka, Vasco and Rauzy, Emmanuel, Effective bases and notions of effective second countability in computable analysis, arXiv arXiv:2509.20266 (2025)
Brattka, Vasco and Smischliaew, Hendrik, Computability of Initial Value Problems, in: Beckmann, Arnold and Oitavem, Isabel and Manea, Florin (eds.), Crossroads of Computability and Logic: Insights, Inspirations, and Innovations, vol. 15764 of Lecture Notes in Computer Science, Springer, Cham, 2025, pages 191-206
Franklin, Johanna and Neumann, Eike and Pauly, Arno and Pradic, Cécilia
and Valenti, Manlio, Represented Spaces of Represented Spaces, in: Beckmann, Arnold and Oitavem, Isabel and Manea, Florin (eds.), Crossroads of Computability and Logic: Insights, Inspirations, and
Innovations, vol. 15764 of Lecture Notes in Computer Science, Springer, Cham, 2025, pages 47-61
Pradic, Cécilia and Price, Ian, Weihrauch Problems as Containers, in: Beckmann, Arnold and Oitavem, Isabel and Manea, Florin (eds.), Crossroads of Computability and Logic: Insights, Inspirations, and
Innovations, vol. 15764 of Lecture Notes in Computer Science, Springer, Cham, 2025, pages 395-409
Bazhenov, Nikolay and Fiori-Carones, Marta and Liu, Lu and Melnikov,
Alexander, Primitive recursive reverse mathematics, Annals of Pure and Applied Logic175:1, Part A (2024) 103354
Brattka, Vasco and Smischliaew, Hendrik, Computability of Initial Value Problems, arXiv arXiv:2501.00451 (2024)
Carroy, Raphaël and Pequignot, Yann, A well-quasi-order for continuous functions, arXiv 2410.13150v1 (2024)
Goh, Jun Le and Pauly, Arno and Valenti, Manlio, The Weakness of Finding Descending Sequences in Ill-Founded Linear
Orders, in: Levy Patey, Ludovic and Pimentel, Elaine and Galeotti, Lorenzo and
Manea, Florin (eds.), Twenty Years of Theoretical and Practical Synergies, Springer Nature Switzerland, Cham, 2024, pages 339-350
Lempp, Steffen and Miller, Joseph S. and Pauly, Arno and Soskova,
Mariya I. and Valenti, Manlio, Minimal covers in the Weihrauch degrees, Proceedings of the American Mathematical Society152:11 (2024) 4893-4901
Li, Ang, Countable Ordered Groups and Weihrauch Reducibility, arXiv 2409.19229 (2024)
Pauly, Arno and Soldá, Giovanni, Sequential Discontinuity and First-Order Problems, in: Levy Patey, Ludovic and Pimentel, Elaine and Galeotti, Lorenzo and
Manea, Florin (eds.), Twenty Years of Theoretical and Practical Synergies, Springer Nature Switzerland, Cham, 2024, pages 351-365
Smischliaew, Hendrik Alexander, Berechenbarkeitseigenschaften von Differentialgleichungen, MSc thesis, Fakultät für Informatik, Universität der Bundeswehr München, Neubiberg, 2024
Brattka, Vasco, On the complexity of learning programs, in: Della Vedova, Gianluca and Dundua, Besik and Lempp, Steffen and Manea, Florin (eds.), Unity of Logic and Computation, vol. 13967 of Lecture Notes in Computer Science, Springer, Cham, 2023, pages 166-177
Brattka, Vasco, On the complexity of computing Gödel numbers, arXiv 2302.04213 (2023)
Cipriani, Vittorio, Many Problems, Different Frameworks, Classification of Problems in
Computable Analysis and Algorithmic Learning Theory, PhD thesis, Universitá degli Studi di Udine, 2023
Cipriani, Vittorio and Pauly, Arno, The Complexity of Finding Supergraphs, in: Della Vedova, Gianluca and Dundua, Besik and Lempp, Steffen and Manea,
Florin (eds.), Unity of Logic and Computation, vol. 13967 of Lecture Notes in Computer Science, Springer, Cham, 2023, pages 178-189
Dzhafarov, Damir and Solomon, Reed and Valenti, Manlio, The tree pigeonhole principle in the Weihrauch degrees, arXiv 2312.10535 (2023)
Dzhafarov, Damir D. and Solomon, Reed and Yokoyama, Keita, On the first-order parts of problems in the Weihrauch degrees, arXiv 2301.12733 (2023)
Gill, Kenneth, Indivisibility and uniform computational strength, arXiv 2312.03919 (2023)
Hoyrup, Mathieu, Topological Aspects of Representations in Computable Analysis, Habilitation Thesis, Laboratoire Lorrain de Recherche en Informatique et ses Applications, Nancy, France, 2023
Lempp, Steffen and Miller, Joseph S. and Pauly, Arno and Soskova,
Mariya I. and Valenti, Manlio, Minimal covers in the Weihrauch degrees, arXiv 2311.12676 (2023)
Lutz, Patrick, The Solecki dichotomy and the Possner-Robinson theorem are
almost equivalent, arXiv 2301.07259 (2023)
Lutz, Patrick and Siskind, Benjamin, Part 1 of Martin's Conjecture for order-preserving and measure-preserving
functions, arXiv 2305.19646 (2023)
Uftring, Patrick, Weihrauch degrees without roots, arXiv 2102.11832 (2023)
2022
Ackerman, Nathanael and Asilis, Julian and Di, Jieqi and Freer, Cameron
and Tristan, Jean-Baptiste, Computable PAC Learning of Continuous Features, in: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer
Science, LICS '22, Association for Computing Machinery, New York, NY, USA, 2022
Amir, Djamel Eddine and Hoyrup, Mathieu, Comparing computability in two topologies, hal-03702999 (2022)
Brattka, Vasco, Weihrauch complexity and the Hagen school of computable analysis, in: Löwe, Benedikt and Sarikaya, Deniz (eds.), 60 Jahre DVMLG, vol. 48 of Tributes, College Publications, London, 2022, pages 13-44
Cipriani, Vittorio and Marcone, Alberto and Valenti, Manlio, The Weihrauch lattice at the level of Π^1_1-CA_0: the Cantor-Bendixson
theorem, arXiv 2210.15556 (2022)
Brattka, Vasco and Gherardi, Guido, Completion of Choice, Annals of Pure and Applied Logic172:3 (2021) 102914
Brattka, Vasco and Gherardi, Guido and Pauly, Arno, Weihrauch Complexity in Computable Analysis, in: Brattka, Vasco and Hertling, Peter (eds.), Handbook of Computability and Complexity in Analysis, Theory and Applications of Computability, Springer, Cham, 2021, pages 367-417
Hirst, Jeffry L. and Mummert, Carl, Using Ramsey's theorem once, Archive for Mathematical Logic58:7-8 (2019) 857-866
Kihara, Takayuki and Pauly, Arno, Finite choice, convex choice and sorting, in: Gopal, T.V. and Watada, Junzo (eds.), Theory and applications of models of computation, vol. 11436 of Lecture Notes in Computer Science, Springer, Cham, 2019, pages 378-393
Davis, Caleb and Hirschfeldt, Denis R. and Hirst, Jeffry L. and Pardo,
Jake and Pauly, Arno and Yokoyama, Keita, Combinatorial principles equivalent to weak induction, arXiv 1812.09943 (2018)
Dzhafarov, Damir D. and Goh, Jun Le and Hirschfeldt, Denis R. and
Patey, Ludovic and Pauly, Arno, Ramsey's theorem and products in the Weihrauch degrees, arXiv 1804.10968 (2018)
Kihara, Takayuki and Marcone, Alberto and Pauly, Arno, Searching for an analogue of ATR in the Weihrauch lattice, arXiv 1812.01549 (2018)
Nobrega, Hugo, Games for functions - Baire classes, Weihrauch degrees, Transfinite
Computations, and Ranks, PhD thesis, Institute for Logic, Language and Computation, Universiteit van Amsterdam, 2018
Thies, Holger, Uniform computational complexity of ordinary differential equations
with applications to dynamical systems and exact real arithmetic, PhD thesis, Graduate School of Arts and Sciences, University of Tokyo, Tokyo, Japan, 2018
Uftring, Patrick, Proof-theoretic characterization of Weihrauch reducibility, M.Sc. thesis, Department of Mathematics, Universität Darmstadt, 2018
2017
Ackerman, Nathanael L. and Freer, Cameron E. and Roy, Daniel M., On computability and disintegration, Mathematical Structures in Computer Science27:8 (2017) 1287-1314
Bienvenu, Laurent and Kuyper, Rutger, Parallel and serial jumps of Weak Weak König's Lemma, in: Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov,
Bakhadyr and Melnikov, Alexander and Rosamond, Frances (eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey
on the Occasion of His 60th Birthday, vol. 10010 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 201-217
Brattka, Vasco and Gherardi, Guido and Hölzl, Rupert and Pauly,
Arno, The Vitali Covering Theorem in the Weihrauch Lattice, in: Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov,
Bakhadyr and Melnikov, Alexander and Rosamond, Frances (eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey
on the Occasion of His 60th Birthday, vol. 10010 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 188-200
Brattka, Vasco and Gherardi, Guido and Pauly, Arno, Weihrauch Complexity in Computable Analysis, arXiv 1707.03202 (2017)
Brattka, Vasco and Hölzl, Rupert and Kuyper, Rutger, Monte Carlo Computability, in: Vollmer, Heribert and Vallée, Brigitte (eds.), 34th Symposium on Theoretical Aspects of Computer Science (STACS
2017), vol. 66 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2017, pages 17:1-17:14
Galeotti, Lorenzo and Nobrega, Hugo, Towards Computable Analysis on the Generalized Real Line, in: Kari, Jarkko and Manea, Florin and Petre, Ion (eds.), Unveiling Dynamics and Complexity, vol. 10307 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 246-257
Hirschfeldt, Denis R., Some Questions in Computable Mathematics, in: Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov,
Bakhadyr and Melnikov, Alexander and Rosamond, Frances (eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey
on the Occasion of His 60th Birthday, vol. 10010 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 22-55
Hirst, Jeffry L. and Mummert, Carl, Reverse Mathematics of Matroids, in: Day, Adam and Fellows, Michael and Greenberg, Noam and Khoussainov,
Bakhadyr and Melnikov, Alexander and Rosamond, Frances (eds.), Computability and Complexity: Essays Dedicated to Rodney G. Downey
on the Occasion of His 60th Birthday, vol. 10010 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 143-159
Nichols, David, Strong Reductions between Relatives of the Stable Ramsey's Theorem, arXiv 1711.06532 (2017)
Nobrega, Hugo and Pauly, Arno, Game Characterizations and Lower Cones in the Weihrauch Degrees, in: Kari, Jarkko and Manea, Florin and Petre, Ion (eds.), Unveiling Dynamics and Complexity, vol. 10307 of Lecture Notes in Computer Science, Springer, Cham, 2017, pages 327-337
Brattka, Vasco, Computability and Analysis, a Historical Approach, in: Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nataša (eds.), Pursuit of the Universal, vol. 9709 of Lecture Notes in Computer Science, Springer, Switzerland, 2016, pages 45-57
Brattka, Vasco and Le Roux, Stéphane and Miller, Joseph S. and
Pauly, Arno, The Brouwer Fixed Point Theorem Revisited, in: Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nataša (eds.), Pursuit of the Universal, vol. 9709 of Lecture Notes in Computer Science, Springer, Switzerland, 2016, pages 58-67
Carl, Merlin, Generalized Effective Reducibility, in: Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nataša (eds.), Pursuit of the Universal, vol. 9709 of Lecture Notes in Computer Science, Springer, Switzerland, 2016, pages 225-233
de Almeida Gabriel Vieira Borges, Ana, On the herbrandised interpretation for nonstandard arithmetic, M.Sc. thesis, Instituto Superior Técnico, Lisbon, 2016
Dorais, François G. and Dzhafarov, Damir D. and Hirst, Jeffry
L. and Mileti, Joseph R. and Shafer, Paul, On uniform relationships between combinatorial problems, Transactions of the American Mathematical Society368:2 (2016) 1321-1359
Kihara, Takayuki and Pauly, Arno, Dividing by Zero - How Bad Is It, Really?, in: Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf (eds.), 41st International Symposium on Mathematical Foundations of Computer
Science (MFCS 2016), vol. 58 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2016, pages 58:1-58:14
Kihara, Takayuki and Pauly, Arno, Dividing by zero–how bad is it, really?, in: 41st International Symposium on Mathematical Foundations
of Computer Science, vol. 58 of LIPIcs. Leibniz Int. Proc. Inform., Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2016, page Art. No. 58, 14
Patey, Ludovic, The reverse mathematics of Ramsey-type theorems, PhD thesis, Université Paris Diderot, Paris, France, 2016
Pauly, Arno and Tsuiki, Hideki, Computable dyadic subbases and \mathbbT^ω-representations
of compact sets, arXiv 1604.0258 (2016)
Solomon, Reed, Computable Reductions and Reverse Mathematics, in: Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Nataša (eds.), Pursuit of the Universal, vol. 9709 of Lecture Notes in Computer Science, Springer, Switzerland, 2016, pages 182-191
2015
Brattka, Vasco and Gherardi, Guido and Hölzl, Rupert, Las Vegas Computability and Algorithmic Randomness, in: Mayr, Ernst W. and Ollinger, Nicolas (eds.), 32nd International Symposium on Theoretical Aspects of Computer Science
(STACS 2015), vol. 30 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2015, pages 130-142
Hirschfeldt, Denis R., Slicing the Truth: On the Computable and Reverse Mathematics of Combinatorial
Principles, vol. 28 of Lecture Notes Series, Institute for Mathematical Sciences, National
University of Singapore, World Scientific, Singapore, 2015
Rakotoniaina, Tahina, On the Computational Strength of Ramsey's Theorem, Ph.D. thesis, Department of Mathematics and Applied Mathematics, University of
Cape Town, Rondebosch, South Africa, 2015
2014
de Brecht, Matthew, Levels of Discontinuity, Limit-Computability, and Jump Operators, in: Brattka, Vasco and Diener, Hannes and Spreen, Dieter (eds.), Logic, Computation, Hierarchies, Ontos Mathematical Logic, Walter de Gruyter, Boston, 2014, pages 93-122
Hertling, Peter and Selivanov, Victor, Complexity issues for preorders on finite labeled forests, in: Brattka, Vasco and Diener, Hannes and Spreen, Dieter (eds.), Logic, Computation, Hierarchies, Ontos Mathematical Logic, Walter de Gruyter, Boston, 2014, pages 165-190
Kawamura, Akitoshi and Ota, Hiroyuki, Small complexity classes for computable analysis, in: Mathematical foundations of computer science 2014. Part II, vol. 8635 of Lecture Notes in Comput. Sci., Springer, Heidelberg, 2014, pages 432-444
Kawamura, Akitoshi and Pauly, Arno, Function spaces for second-order polynomial time, in: Language, life, limits, vol. 8493 of Lecture Notes in Comput. Sci., Springer, Cham, 2014, pages 245-254
Neumann, Eike, Computational Problems in Metric Fixed Point Theory and their Weihrauch
Degrees, M.Sc. thesis, Department of Mathematics, Universität Darmstadt, 2014
Pauly, Arno and de Brecht, Matthew, Non-deterministic computation and the Jayne-Rogers Theorem, in: Löwe, Benedikt and Winskel, Glynn (eds.), Proceedings 8th International Workshop on Developments in Computational
Models, DCM 2012, Cambridge, United Kingdom, 17 June 2012., vol. 143 of Electronic Proceedings in Theoretical Computer Science, 2014, pages 87-96
2013
Carroy, Raphaël, Functions of the first Baire class, PhD thesis, University of Lausanne and University Paris 7, 2013
de Holanda Cunha Nobrega, Hugo, Game characterizations of function classes and Weihrauch degrees, M.Sc. Thesis, MSc in Logic at the Universiteit van Amsterdam, 2013
Le Roux, Stéphane and Pauly, Arno, Closed Choice for Finite and for Convex Sets, in: Bonizzoni, Paola and Brattka, Vasco and Löwe, Benedikt (eds.), The Nature of Computation. Logic, Algorithms, Applications, vol. 7921 of Lecture Notes in Computer Science, Springer, Berlin, 2013, pages 294-305
Pauly, Arno and de Brecht, Matthew, Towards Synthetic Descriptive Set Theory: An instantiation with represented
spaces, arXiv 1307.1850 (2013)
Selivanov, Victor, Total Representations, Logical Methods in Computer Science9 (2013) 2:5, 30
Brattka, Vasco and Le Roux, Stéphane and Pauly, Arno, On the Computational Content of the Brouwer Fixed Point Theorem, in: Cooper, S. Barry and Dawar, Anuj and Löwe, Benedikt (eds.), How the World Computes, vol. 7318 of Lecture Notes in Computer Science, Springer, Berlin, 2012, pages 57-67
Higuchi, Kojiro, Degree Structures of Mass Problems and Choice Functions, PhD thesis, Mathematical Institute, Tohoku University, Sendai, Japan, 2012
Hertling, Peter and Selivanov, Victor, Complexity issues for preorders on finite labeled forests, in: Löwe, Benedikt and Normann, Dag and Soskov, Ivan and Soskova,
Alexandra (eds.), Models of computation in context, vol. 6735 of Lecture Notes in Computer Science, Springer, Heidelberg, 2011, pages 112-121
Hoyrup, Mathieu and Rojas, Cristóbal and Weihrauch, Klaus, Computability of the Radon-Nikodym derivative, in: Löwe, Benedikt and Normann, Dag and Soskov, Ivan and Soskova,
Alexandra (eds.), Models of Computation in Context, vol. 6735 of Lecture Notes in Computer Science, Springer, Heidelberg, 2011, pages 132-141
Pauly, Arno, Computable Metamathematics and its Application to Game Theory, Ph.D. thesis, University of Cambridge, Computer Laboratory, Clare College, Cambridge, 2011
Brattka, Vasco and Pauly, Arno, Computation with Advice, in: Zheng, Xizhong and Zhong, Ning (eds.), CCA 2010, Proceedings of the Seventh International Conference on
Computability and Complexity in Analysis, vol. 24 of Electronic Proceedings in Theoretical Computer Science, 2010, pages 41-55
Kawamura, Akitoshi and Cook, Stephen, Complexity theory for operators in analysis, in: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC '10, ACM, New York, 2010, pages 495-502
Kudinov, Oleg V. and Selivanov, Victor L. and Zhukov, Anton V., Undecidability in Weihrauch Degrees, in: Ferreira, Fernando and Löwe, Benedikt and Mayordomo, Elvira and
Mendes Gomes, Luís (eds.), Programs, Proofs, Processes, vol. 6158 of Lecture Notes in Computer Science, Springer, Berlin, 2010, pages 256-265
Brattka, Vasco and Gherardi, Guido, Weihrauch Degrees, Omniscience Principles and Weak Computability, in: Bauer, Andrej and Hertling, Peter and Ko, Ker-I (eds.), CCA 2009, Proceedings of the Sixth International Conference on
Computability and Complexity in Analysis, Leibniz-Zentrum für Informatik, Schloss Dagstuhl, Germany, 2009, pages 83-94
Brattka, Vasco and Gherardi, Guido, Effective Choice and Boundedness Principles in Computable Analysis, in: Bauer, Andrej and Hertling, Peter and Ko, Ker-I (eds.), CCA 2009, Proceedings of the Sixth International Conference on
Computability and Complexity in Analysis, Leibniz-Zentrum für Informatik, Schloss Dagstuhl, Germany, 2009, pages 95-106
Brattka, Vasco and Gherardi, Guido, Borel Complexity of Topological Operations on Computable Metric Spaces, Journal of Logic and Computation19:1 (2009) 45-76
Pauly, Arno, How Discontinuous is Computing Nash Equilibria? (Extended Abstract), in: Bauer, Andrej and Hertling, Peter and Ko, Ker-I (eds.), 6th International Conference on Computability and Complexity in Analysis
(CCA'09), vol. 11 of OpenAccess Series in Informatics (OASIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2009
2008
Gherardi, Guido and Marcone, Alberto, How Incomputable is the Separable Hahn-Banach Theorem?, in: Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch,
Angela (eds.), CCA 2008, Fifth International Conference on Computability and Complexity
in Analysis, vol. 221 of Electronic Notes in Theoretical Computer Science, Elsevier, 2008, pages 85-102
2007
Pauly, Arno, Methoden zum Vergleich der Unstetigkeit von Funktionen, M.Sc. thesis, FernUniversität Hagen, 2007
2006
Gherardi, Guido, An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According
to Effective Borel Measurability, in: Beckmann, A. and Berger, U. and Löwe, B. and Tucker, J.V. (eds.), Logical Approaches to Computational Barriers, vol. 3988 of Lecture Notes in Computer Science, Springer, Berlin, 2006, pages 199-208
Gherardi, Guido, Effective Borel degrees of some topological functions, Mathematical Logic Quarterly52:6 (2006) 625-642
Gherardi, Guido, Some Results in Computable Analysis and Effective Borel Measurability, PhD thesis, University of Siena, Department of Mathematics and Computer Science, Siena, 2006
Mylatz, Uwe, Vergleich unstetiger Funktionen: "Principle of Omniscience"
und Vollständigkeit in der C-Hierarchie, Ph.D. thesis, Faculty for Mathematics and Computer Science, University Hagen, Hagen, Germany, 2006
2005
Brattka, Vasco, Effective Borel measurability and reducibility of functions, Mathematical Logic Quarterly51:1 (2005) 19-44
Brattka, Vasco, Computable Invariance, in: Jiang, Tao and Lee, D.T. (eds.), Computing and Combinatorics, vol. 1276 of Lecture Notes in Computer Science, Springer, Berlin, 1997, pages 146-155
1996
Hertling, Peter, Unstetigkeitsgrade von Funktionen in der effektiven Analysis, Dissertation, Fachbereich Informatik, FernUniversität Hagen, 1996
1994
Hertling, Peter and Weihrauch, Klaus, Levels of degeneracy and exact lower complexity bounds for geometric
algorithms, in: Proceedings of the Sixth Canadian Conference on Computational Geometry, 1994, pages 237-242
Hertling, Peter and Weihrauch, Klaus, On the topological classification of degeneracies, technical report, FernUniversität Hagen, Hagen, 1994
1993
Brattka, Vasco, Grade der Nichtstetigkeit in der Analysis, Diplomarbeit, Fachbereich Informatik, FernUniversität Hagen, 1993
Hertling, Peter, Topologische Komplexitätsgrade von Funktionen mit endlichem
Bild, technical report, FernUniversität Hagen, Hagen, 1993
Hertling, Peter, Stetige Reduzierbarkeit auf Σ^ω von Funktionen
mit zweielementigem Bild und von zweistetigen Funktionen mit
diskretem Bild, technical report, FernUniversität Hagen, Hagen, 1993
Hertling, Peter, A topological complexity hierarchy of functions with finite range, technical report, Centre de recerca matematica, Institut d'estudis catalans, Barcelona, Barcelona, 1993
1992
Mylatz, Uwe, Vergleich unstetiger Funktionen in der Analysis, Diplomarbeit, Fachbereich Informatik, FernUniversität Hagen, 1992
Weihrauch, Klaus, The degrees of discontinuity of some translators between representations
of the real numbers, technical report, International Computer Science Institute, Berkeley, 1992
Weihrauch, Klaus, The degrees of discontinuity of some translators between representations
of the real numbers, technical report, FernUniversität Hagen, Hagen, 1992
Weihrauch, Klaus, The TTE-interpretation of three hierarchies of omniscience principles, technical report, FernUniversität Hagen, Hagen, 1992
1989
von Stein, Thorsten, Vergleich nicht konstruktiv lösbarer Probleme in der Analysis, Diplomarbeit, Fachbereich Informatik, FernUniversität Hagen, 1989
This bibliography web page has currently 263 entries