NFFC

Recent advances in computability theory have uncovered new pathways to apply computability to prove theorems in other areas of mathematics. Examples include a long-open question in topological dimension theory answered by Kihara and Pauly using computability-theoretic methods and a new proof of the 2-dimensional Kakeya conjecture by Lutz and Lutz. By bringing together the right experts, we will deepen those pathways and find more such applications.

In a parallel development, we will focus on implementating algorithms working on continuous data types. This, too, has promising applications in diverse areas of mathematics. For example, tools that can compute Bloch's constant or the solution to the Lebesgue universal covering problem are within our grasp -- and both these numbers are only known up to the first post-decimal digit. The tools to be developed also have applications outside of mathematics, such as for the verification of hybrid systems.

Both routes to applications built on a shared theoretical foundation, which in itself will be developed further.