BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Could Computers Understand Their Own Programs - Prof Sir Tony Hoar
 e -  Microsoft Research &amp\; Computer Laboratory
DTSTART:20130424T133000Z
DTEND:20130424T143000Z
UID:TALK45099@talks.cam.ac.uk
CONTACT:David Greaves
DESCRIPTION:\nCould Computers Understand Their Own Programs? – In summar
 y\, my answer to the question is Yes.\n\nIn principle\, computers could un
 derstand their own programs\, and those of other computers\, although thei
 r understanding is rather weak at present. It was Alan Turing who suggeste
 d that we can gather evidence of the understanding of computers if we subj
 ect them to the same kind of examination that we have inflicted on many ge
 nerations students at schools and universities. An examination usually req
 uires the student to justify each given answer by logical reasoning. The m
 ost rigorous principles of logical reasoning was first formulated by the a
 ncient Greek Philosopher Aristotle\; and they were further refined by the 
 ancient Egyptian philosopher Euclid. Finally\, Alan Turing also showed tha
 t these principles apply equally to logical reasoning about computer progr
 ams. Finally\, I will suggest how to set the pass mark in the examination.
  A computer passes the test of understanding if the answers to the questio
 ns about its own program are useful to the human software engineer who wro
 te the program. I hope that one day\, computers will pass this test. Then 
 they will be able to serve as intelligent assistants to the programmer dur
 ing the task of writing the programs. 
LOCATION:Lecture Theatre 1\, Computer Laboratory
END:VEVENT
END:VCALENDAR