Explore a comprehensive lecture on computational number theory, delving into case studies that illuminate the intersection of computation and formalization. Gain insights from experts Sander Dahmen and Alain Chavarri Villarello as they present their research and findings in this 37-minute talk hosted by the Hausdorff Center for Mathematics. Discover how advanced computational techniques are applied to solve complex problems in number theory and learn about the importance of formalizing mathematical proofs in the digital age.
Computation and Formalization - Case Studies in Computational Number Theory
Hausdorff Center for Mathematics via YouTube
Overview
Syllabus
Sander Dahmen and Alain Chavarri Villarello: Computation and formalization
Taught by
Hausdorff Center for Mathematics
Related Courses
-
Introduction to Computation Theory
5.0 -
Formalizing Deligne's Theorem in Number Theory
-
Challenges in Formalising Recent Results in Formal Language Theory
-
Formalizing Infinity-Category Theory in the Rzk Proof Assistant
-
Undergrad Complexity at CMU - Turing Machines
-
First Order Concatenation Theory vs First Order Number Theory
