Exploring the fundamental limits of computation with Susanna de Rezende

Summary

This article explores the fundamental limits of computation, focusing on whether there are problems that computers cannot solve. It features Wallenberg Academy Fellow Susanna de Rezende, a mathematician and computer scientist who researches computational complexity theory. The article discusses her work on proof complexity and circuit complexity, which aims to understand the boundaries of what computers can and cannot compute. It connects these theoretical questions to practical applications in cryptography and cybersecurity, where the assumption that certain problems are computationally hard is essential for security systems.