Dr Manlio Valenti

Lecturer in Computer Science

Computer Science

manlio.valenti@swansea.ac.uk

Office - 326
Third Floor
Computational Foundry
Bay Campus

Available For Postgraduate Supervision

Research Links

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

Scopus

About

Manlio Valenti is a Lecturer in the Department of Computer Science, Swansea University.

Areas Of Expertise

Computability theory
Computable analysis
Weihrauch reducibility

Publications

Research Highlights

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
Pauly, A., Valenti, M., Lempp, S., Miller, J., & Soskova, M. (n.d.) Minimal covers in the Weihrauch degrees. Proceedings of the American Mathematical Society
SU Repository: https://cronfa.swan.ac.uk/Record/cronfa66479

All Research

Journal Articles

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
Pauly, A., Valenti, M., Lempp, S., Miller, J., & Soskova, M. (n.d.) Minimal covers in the Weihrauch degrees. Proceedings of the American Mathematical Society
SU Repository: https://cronfa.swan.ac.uk/Record/cronfa66479

Conference Contributions

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

Supervision

Untitled (current)

PhD

Other supervisor: Dr Arno Pauly

Taught Modules

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.