University of Cambridge > Talks.cam > Probability + Information Reading Group

Probability + Information Reading Group

Add to your list(s) Send you e-mail reminders Further detail
Subscribe using ical/vcal (Help)

A forum for the discussion of interesting work on the foundations of probability theory and information theory, and work making novel or pioneering application of these theoretical tools to illuminate the foundations of physical theory.

Tell a friend about this series:

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

0 upcoming talks and 10 talks in the archive.

Gull and Skilling's "The Maximum Entropy Method"

UserSpeaker to be confirmed.

HouseRoom 911, Cavendish Laboratory.

ClockWednesday 23 November 2005, 11:30-12:30

Knuth's "Source Separation as an exercise in logical inference"

UserSpeaker to be confirmed.

HouseRoom 911, Cavendish Laboratory.

ClockWednesday 16 November 2005, 11:30-12:30

John Skilling's "The Calculus of Rational Inference"

UserSpeaker to be confirmed.

HouseRoom 911, Cavendish Laboratory.

ClockWednesday 09 November 2005, 11:30-12:30

Knuth's "Lattice Duality: The Origin of Probability and Information"

UserSpeaker to be confirmed.

HouseRoom 911, Cavendish Laboratory.

ClockWednesday 02 November 2005, 11:30-12:30

Knuth's "Lattice Duality: The Origin of Probability and Information" (4)

UserSpeaker to be confirmed.

HouseRoom 911, Cavendish Laboratory.

ClockWednesday 26 October 2005, 11:30-12:30

Knuth's "Lattice Duality: The Origin of Probability and Information" (3)

UserSpeaker to be confirmed.

HouseRoom 911, Cavendish Laboratory.

ClockWednesday 19 October 2005, 11:30-12:30

Knuth's "Lattice Duality: The Origin of Probability and Information"

UserSpeaker to be confirmed.

HouseRoom 911, Cavendish Laboratory.

ClockWednesday 05 October 2005, 11:00-12:00

Please see above for contact details for this list.

 

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