Abstract

Computability theory began from philosophical questions in the 1930s and developed into an area of mathematics and theoretical computer science. The reach of traditional computability theory, however, is restricted to discrete mathematics.

Making sense of computability in non-discrete settings is the goal of computable analysis, which has seen tremendous progress in the past decades: we have workable definitions of what computing with a broad variety of mathematical objects means, as well as conceptual tools to investigate those notions.

The scientific aim of this project is to exploit this foundation to obtain novel results in mathematics in general, in meta-mathematics, and in applied areas.

Partenariato

• Swansea University (United Kingdom) coordinator
• Univesidad de Zaragoza (Spain)
• University of Leeds (United Kingdom)
• Università degli Studi di Udine (Italy)
• Universitaet der Bundeswehr Muenchen (Germany)
• Faculty of Science University of Zagreb (Croatia)
• University of Connecticut (United States)
• University of Wisconsin (United States)
• Nagoya University Graduate School of Informatics (Japan)
• Victoria University of Wellington (New Zealand)
• Nanyang Technological University (Singapore)
• Institut za Matematiko, Fiziko in Mehaniko (Slovenia)
• Kokuritsu Daigaku Hojin Kyoto Daigaku (Japan)
• Universitaet Siegen (Germany)
• Institut National de Recherche en Informatique et Automatique (France)
• Korea Advanced Institute of Science and Technology (South Korea)
• National University of Singapore (Singapore)

Importo del progetto

Importo totale del progetto: euro 435.870
Importo del progetto Uniud:  euro 60.120€
Finanziamento Uniud: euro -

Durata

• Data avvio progetto: 01/01/2026
• Data conclusione progetto: 31/12/2029