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.
List of papers
- Algorithmic learning theory
- Nikolay Bazhenov, Vittorio Cipriani and Luca San Mauro Calculating the Mind Change Complexity of Learning Algebraic Structures 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;
- Nikolay Bazhenov, Vittorio Cipriani and Luca San Mauro Learning algebraic structures with the help of Borel equivalence relations Theoretical Computer Science, 951:113762, 2023, available at https://arxiv.org/abs/2110.14512
- Classical learning paradigms and algebraic structures (with Nikolay Bazhenov, Sanjay Jain, Luca San Mauro and Frank Stephan), in preparation.
- Computable analysis
- Vittorio Cipriani, Alberto Marcone and Manlio Valenti The Weihrauch lattice at the level of $\mathbf{\Pi}_1^1\text{-}\mathsf{CA}_0$: the Cantor-Bendixson theorem, submitted. Available at https://arxiv.org/abs/2210.15556;
- Vittorio Cipriani and Arno Pauly The uniform computational content of the (induced) subgraph problem, submitted.
- Vittorio Cipriani and Arno Pauly The complexity of finding supergraphs, 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
Teaching Experience
(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
13 contributed talks given in several editions of Logic Colloquium, Computability in Europe, Computability and Complexity in Analysis and Continuity, Computability, Constructivity and Computability, Complexity and Randomness.
-
(November 2021) Invited talk ad Midwest computability seminars "Cantor-Bendixson theorem in the Weihrauch lattice".
