University of Cambridge > Talks.cam > Mathematics and Computation

If you have a question about this list, please contact: Challenger Mishra. If you have a question about a specific talk, click on that talk to find its organiser.

0 upcoming talks and 9 talks in the archive.

Deep-layered machines have a built-in Occam's razor

UserDr Thomas Fink, Director, London Institute for Mathematical Sciences.

HouseComputer Lab, FW26 and Online (link in abstract).

ClockWednesday 11 March 2026, 12:00-13:00

A central limit theorem for partitions involving generalised divisor function

UserMadhuparna Das, Dept of Mathematics, University of Exeter.

HouseComputer Lab, FW09 and Online (link in abstract).

ClockWednesday 15 October 2025, 15:00-16:00

Colored Jones polynomials and the volume conjecture

UserProf Vishnu Jejjala, School of Physics, University of the Witwatersrand.

HouseComputer Lab, FW26 and Online (link in abstract).

ClockTuesday 24 June 2025, 14:00-15:30

Diophantine Geometry and the Theory of Computation (Part V)

UserProf Minhyong Kim, International Centre for Mathematical Sciences, Edinburgh.

HouseComputer Lab, FW26 and Online (link in abstract).

ClockFriday 30 May 2025, 14:00-15:30

Diophantine Geometry and the Theory of Computation (Part IV)

UserProf Minhyong Kim, International Centre for Mathematical Sciences, Edinburgh.

HouseComputer Lab, FW26 and Online (link in abstract).

ClockWednesday 28 May 2025, 14:00-15:30

Diophantine Geometry and the Theory of Computation (Part III)

UserProf Minhyong Kim, International Centre for Mathematical Sciences, Edinburgh.

HouseComputer Lab, FW26 and Online (link in abstract).

ClockMonday 26 May 2025, 14:00-15:30

Diophantine Geometry and the Theory of Computation (Part II)

UserProf Minhyong Kim, International Centre for Mathematical Sciences, Edinburgh.

HouseComputer Lab, FW26 and Online (link in abstract).

ClockFriday 23 May 2025, 14:00-15:30

Please see above for contact details for this list.

 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity