Vittorio Cipriani

Vittorio Cipriani

Email:

I am a research fellow at the Institute of Discrete Mathematics and Geometry at the Vienna University of Technology, employed on FWF project ESP4063225 "The Learning Hierarchy: a tool for classification problems".

I got my Ph.D. at the University of Udine in May 2023 under the supervision of Prof. Alberto Marcone and Dr. Luca San Mauro with the thesis "Many problems, different frameworks: Classification of Problems in Computable Analysis and Algorithmic Learning Theory".

Research Interests

Computable analysis (in particular, Weihrauch reducibility and its connections to reverse mathematics), algorithmic learning theory of algebraic structure, (effective) descriptive set theory.

Publications and preprints

  1. Calculating the Mind Change Complexity of Learning Algebraic Structures (with Bazhenov and San Mauro). In: Berger, U., Franklin, J.N.Y., Manea, F., Pauly, A. (eds) Revolutions and Revelations in Computability. CiE 2022. Lecture Notes in Computer Science, vol 13359. Springer, Cham. https://doi.org/10.1007/978-3-031-08740-0_1.
  2. Learning algebraic structures with the help of Borel equivalence relations (with Bazhenov and San Mauro). Theoretical Computer Science, 2023. https://doi.org/10.1016/j.tcs.2023.113762. Available on arXiv.
  3. The Weihrauch lattice at the level of Π11-CA0 : the Cantor-Bendixson theorem (with Marcone and Valenti). The Journal of Symbolic Logic, 2025. doi:10.1017/jsl.2024.72. Available on arXiv.
  4. The complexity of finding supergraphs (with Pauly). In: Della Vedova, G., Dundua, B., Lempp, S., Manea, F. (eds) Unity of Logic and Computation. CiE 2023. Lecture Notes in Computer Science, vol 13967. Springer, Cham. https://doi.org/10.1007/978-3-031-36978-0_15.
  5. Embeddability of graphs and Weihrauch degrees (with Pauly). Journal of Mathematical Logic, 2025. https://www.worldscientific.com/doi/10.1142/S0219061325500114. Available on arXiv.
  6. Classifying different criteria for learning algebraic structures (with Bazhenov, Jain, San Mauro and Stephan). Annals of Pure and Applied Logic, 2025. https://doi.org/10.1016/j.apal.2025.103648. Available on arXiv.
  7. Dichotomy results for classes of countable graphs (with Fokina, Harrison-Trainor, Ko and Rossegger). Submitted. Available on arXiv.
  8. Arithmetical Aspects of Unfriendly Partitions (with Goh and Stephan). Submitted.
  9. The tolerant learning hierarchy for c.e. sets (with Ritter and San Mauro). Submitted. Available on arXiv.
  10. Towards characterizing the initial segments of the degrees of the ceers (with Ng, Lempp and San Mauro) Submitted
  11. On the learning power of Friedman-Stanley jumps (with Marcone and San Mauro). Submitted. Available on arXiv.
  12. On statistical learning of graphs (with Delle Rose, San Mauro and Soldà). Submitted. Available on arXiv.
  13. Uniformity in learning structures (with Rossegger). Submitted. Available on arXiv.
  14. Hyperarithmetical Aspects of Unfriendly Partitions (with Goh, Richter, Stephan, and Tang). In preparation.

Teaching

(2021–2022) Teaching assistant for the course of Linear Algebra, Bachelor degree in Internet of Things, Big Data, Machine Learning, Uniud, held by Prof. D'Agostino.

Talks