2010 Turing Lecture

15 March 2010

Embracing Uncertainty: The New Machine Intelligence

Christopher Bishop
Microsoft Research Cambridge
5.00pm / 5.30pm Thursday 18 March 2010
Appleton Tower

Computers are traditionally viewed as logical machines which follow precise, deterministic instructions.

The real world in which they operate, however, is full of complexity, ambiguity, and uncertainty. In this year’s Turing Lecture, Professor Chris Bishop discusses the field of machine learning, and shows how uncertainty can be modelled and quantified using probabilities.

He looks at the recent developments in probabilistic modelling which have greatly expanded the variety and scale of machine learning applications, and he explores the future potential for this technology.

In honour and recognition of Alan Turing’s contribution in the field of computing, the IET and the BCS established the Turing Lecture in 1999. It is a world leading event, presenting a topic from current research in computer science given by an acknowledged expert in the field.

Professor Bishop is Chief Research Scientist at the Microsoft Research Laboratory in Cambridge, and also holds a Chair in Computer Science in The University of Edinburgh School of Informatics. He presented the 2008 Royal Institution Christmas Lectures Hi-Tech Trek — The Quest for the Ultimate Computer.

He’s an excellent speaker, and this looks to be an interesting talk about recent advances in and applications of machine learning. There is a reception at 5pm, with the lecture at 5.30pm, and a ticket-only event afterwards. The lecture is free, but the IET ask for registration; which in turn means you need to create an account at the IET website; which means handing over address, phone number, eye colour, etc. Sorry about that.

Links: Registration; Video of this lecture in London; The British Computer Society on the Turing Lecture; The Institution of Engineering and Technology on the Turing Lecture.

APL17: Guest Lecture

9 March 2009

Method Duplication

Alastair Donaldson

Codeplay Software Limited

9am Monday 9 March 2009

Read the rest of this entry »

APL13: Guest Lecture

21 February 2009

Database Programming without Tiers

Sam Lindley

Laboratory for Foundations of Computer Science
School of Informatics
The University of Edinburgh

9am Monday 23 February 2009

Read the rest of this entry »

LFCS Seminar

18 February 2009

There’s an APL-relevant seminar in the Forum this Thursday afternoon.

A Monad for Exhaustively Searching
Infinite Sets in Finite Time

Martín Escardo

University of Birmingham

4pm Thursday, 19th of February, 2009
Room 4.31/4.33, Informatics Forum

Links: Seminar abstract; LFCS Seminar series

This talk will show how to use monads in Haskell to structure and execute exhaustive search over (certain) infinite sets.  Martín is a great speaker, and has also done fascinating work on exact real computation.  He’s interested in having APL students along to the talk, and it should be accessible to those interested in programming languages and mathematics.

You’ll need to sign in to enter the Forum, but just state that you are attending a research seminar, following item 3 of the Forum access policy.