The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Swedish Research Council funds Noah Fleming

A man in a black jacket is standing in front of a mountain.
The power and limitations of algorithms is in focus for the research of Noah Fleming, an assistant professor in the Department of Computer Science at Lund University.

Noah Fleming, an assistant professor in the Department of Computer Science, has received funding from the Vetenskapsrådet / Swedish Research Council calls within Natural and Engineering Sciences 2026. For him, this means SEK 4.8 million in funding over four years.

“This grant will allow me to grow my group by hiring a second Ph.D. student. This will also be a boon for our theoretical computer science group, which together with Susanna de Rezende and Jakob Nordström’s recent grants, has grown significantly over the past few years.”

The aim of the project – “Mot en förståelse av starka bevissystem” (“Towards an understanding of strong proof systems”) – is to understand the types of reasoning capable in different classes of algorithms, as a means of understanding the power and limitations of these algorithms. 

A key for understanding the world in the age of large language models

“Developing a formal understanding of what algorithms can and cannot do is becoming more and more important with the rapid increase in our computing capabilities. This research contributes to the body of work known as computational complexity theory, which aims to develop a formal understanding of computation – what can and cannot be computed efficiently. With the rapid increase in our computing capabilities, in particular in large language models, this is becoming even more important for understanding our world. In particular, answering questions such as what these algorithms are capable of, what their fundamental limitations are, whether they can be modified to overcome them, and where we expect computation to evolve in the future. For example, this is important for cryptography and security, where we would like to be certain that the security that we use is indeed secure”, says Noah Fleming.