Can Computers Understand Their Own Programs?

author: Charles Antony Richard Hoare, Microsoft Research
published: July 10, 2012,   recorded: June 2012,   views: 821
Categories

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

The answer depends on ideas of philosophy, logic, proofs of programs, and self-application. These are interests which I share with Turing, and which go back to the ancient philosophers Aristotle and Euclid. Their teachings provide an excellent basis for a general understanding, even today. In conclusion, I propose a kind of Turing test to answer the question posed by my title.

See Also:

Download slides icon Download slides: turing100_hoare_computers_01.pdf (1.6┬áMB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 Tan Nguyen, October 17, 2012 at 6:22 a.m.:

FYI. Video stops at 35:58 mark (Summary of Euclid method) at 9:20 pm PST Oct 16, 2012... Hopefully these stoppages are for scheduled maintenance. A bit strange still that i can post this comment but not continuing to watch. Thanks.


Comment2 Tan Nguyen, October 17, 2012 at 6:37 a.m.:

Never mind, i noticed if i moved the time slider video would freeze, and reset the page to unblock.


Comment3 Tan Nguyen, October 17, 2012 at 6:55 a.m.:

As a comment on the Analogies slide, Pr. Hoare might like to watch this demo: http://www.youtube.com/watch?v=Fg_JcK...

Write your own review or comment:

make sure you have javascript enabled or clear this field: