Dr Manlio Valenti

Darlithydd mewn Cyfrifiadureg

Computer Science

manlio.valenti@abertawe.ac.uk

326
Trydydd Llawr
Y Ffowndri Gyfrifiadol
Campws y Bae

Ar gael ar gyfer Goruchwyliaeth Ôl-raddedig

Dolenni Ymchwil

https://orcid.org/0000-0003-0351-3058

Scopus

Trosolwg

Mae Manlio Valenti yn Ddarlithydd yn yr Adran Gyfrifiadureg, Prifysgol Abertawe.

Meysydd Arbenigedd

Damcaniaeth cyfrifadwyedd (computability)
Dadansoddi cyfrifadwy
Gostyngadwyedd (reducibility) Weihrauch

Cyhoeddiadau

Uchafbwyntiau Ymchwil

Goh, J., Pauly, A., & Valenti, M. (2024). The Weakness of Finding Descending Sequences in Ill-Founded Linear Orders. In Twenty Years of Theoretical and Practical Synergies (pp. 339-350). Springer Nature Switzerland.
https://doi.org/10.1007/978-3-031-64309-5_27, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa66589
Valenti, M., GOH, J., Pauly, A., & VALENTI, M. (2021). FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS. The Journal of Symbolic Logic, 86(2), 817-854.
https://doi.org/10.1017/jsl.2021.15, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa57509
Soldà, G. & Valenti, M. (2023). Algebraic properties of the first-order part of a problem. Annals of Pure and Applied Logic, 174(7), 103270
https://doi.org/10.1016/j.apal.2023.103270, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65548
Marcone, A. & Valenti, M. (2022). Effective aspects of Hausdorff and Fourier dimension. Computability, 11(3-4), 299-333.
https://doi.org/10.3233/com-210372, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65549
Marcone, A. & Valenti, M. (2021). On the descriptive complexity of Salem sets. Fundamenta Mathematicae, 257(1), 69-93.
https://doi.org/10.4064/fm997-7-2021, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65550
MARCONE, A. & Valenti, M. (2021). THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE. The Journal of Symbolic Logic, 86(1), 316-351.
https://doi.org/10.1017/jsl.2021.10, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65551
Lempp, S., Miller, J., Pauly, A., Soskova, M., & Valenti, M. (2024). Minimal covers in the Weihrauch degrees. Proceedings of the American Mathematical Society, 152(11), 4893-4901.
https://doi.org/10.1090/proc/16952, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa66479
DZHAFAROV, D., SOLOMON, R., & Valenti, M. (2025). THE TREE PIGEONHOLE PRINCIPLE IN THE WEIHRAUCH DEGREES. The Journal of Symbolic Logic, 0, 1-23.
https://doi.org/10.1017/jsl.2025.11, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa69108
Neumann, E., Pauly, A., Pradic, C., & Valenti, M. (2025). Computably Discrete Represented Spaces. In Lecture Notes in Computer Science (pp. 349-364). Springer Nature Switzerland.
https://doi.org/10.1007/978-3-031-95908-0_25, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa69811
Franklin, J., Neumann, E., Pauly, A., Pradic, C., & Valenti, M. (2025). Represented Spaces of Represented Spaces. In Lecture Notes in Computer Science (pp. 47-61). Springer Nature Switzerland.
https://doi.org/10.1007/978-3-031-95908-0_4, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa69812

Holl Ymchwil

Erthyglau Cylchgronau

DZHAFAROV, D., SOLOMON, R., & Valenti, M. (2025). THE TREE PIGEONHOLE PRINCIPLE IN THE WEIHRAUCH DEGREES. The Journal of Symbolic Logic, 0, 1-23.
https://doi.org/10.1017/jsl.2025.11, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa69108
Lempp, S., Miller, J., Pauly, A., Soskova, M., & Valenti, M. (2024). Minimal covers in the Weihrauch degrees. Proceedings of the American Mathematical Society, 152(11), 4893-4901.
https://doi.org/10.1090/proc/16952, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa66479
Soldà, G. & Valenti, M. (2023). Algebraic properties of the first-order part of a problem. Annals of Pure and Applied Logic, 174(7), 103270
https://doi.org/10.1016/j.apal.2023.103270, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65548
Marcone, A. & Valenti, M. (2022). Effective aspects of Hausdorff and Fourier dimension. Computability, 11(3-4), 299-333.
https://doi.org/10.3233/com-210372, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65549
Marcone, A. & Valenti, M. (2021). On the descriptive complexity of Salem sets. Fundamenta Mathematicae, 257(1), 69-93.
https://doi.org/10.4064/fm997-7-2021, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65550
Valenti, M., GOH, J., Pauly, A., & VALENTI, M. (2021). FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS. The Journal of Symbolic Logic, 86(2), 817-854.
https://doi.org/10.1017/jsl.2021.15, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa57509
MARCONE, A. & Valenti, M. (2021). THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE. The Journal of Symbolic Logic, 86(1), 316-351.
https://doi.org/10.1017/jsl.2021.10, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa65551

Cyfraniadau Cynadleddau

Neumann, E., Pauly, A., Pradic, C., & Valenti, M. (2025). Computably Discrete Represented Spaces. In Lecture Notes in Computer Science (pp. 349-364). Springer Nature Switzerland.
https://doi.org/10.1007/978-3-031-95908-0_25, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa69811
Franklin, J., Neumann, E., Pauly, A., Pradic, C., & Valenti, M. (2025). Represented Spaces of Represented Spaces. In Lecture Notes in Computer Science (pp. 47-61). Springer Nature Switzerland.
https://doi.org/10.1007/978-3-031-95908-0_4, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa69812
Goh, J., Pauly, A., & Valenti, M. (2024). The Weakness of Finding Descending Sequences in Ill-Founded Linear Orders. In Twenty Years of Theoretical and Practical Synergies (pp. 339-350). Springer Nature Switzerland.
https://doi.org/10.1007/978-3-031-64309-5_27, SU Repository: https://cronfa.swan.ac.uk/Record/cronfa66589

Goruchwyliaeth

Results on the Weihrauch degree structure of geometric measure theory (cyfredol)

PhD

Goruchwyliwr arall: Dr Arno Pauly

Modiwlau a Addysgir

CS-275 Automata and Formal Language Theory

This module introduces the notion of grammars for defining the syntax of formal languages, especially programming languages. It introduces the limits of computation using Turing Machines and other models of computation.
CSCM22 Symbolic Artificial Intelligence and Natural Language Processing

This module will introduce the symbolic, statistical, and structural properties of language, explain and compare some of the major approaches in symbolic AI and Natural Language Processing, and explain their relevance to practical computing application areas.
CSCM422 Symbolic AI and Natural Language Processing

This module provides a comprehensive introduction to the foundational concepts of symbolic logic and the Chomsky hierarchy, covering regular languages, grammars, and regular expressions. It explores the limitations of regular languages and delves into context-free grammars, alongside practical implementation and evaluation of grammars. The course transitions towards probabilistic natural language processing (NLP) with topics such as text classification, N-gram language models, and sequence models. Additionally, it examines distributional semantics and concludes with an overview of deep learning approaches in NLP.

Dr Manlio Valenti

Cyfeiriad ebost