Can Computers Understand Their Own Programs?
author: Charles Antony Richard Hoare,
Microsoft Research
published: July 10, 2012, recorded: June 2012, views: 6645
published: July 10, 2012, recorded: June 2012, views: 6645
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.
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.
Download slides:
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:
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.
Never mind, i noticed if i moved the time slider video would freeze, and reset the page to unblock.
As a comment on the Analogies slide, Pr. Hoare might like to watch this demo: http://www.youtube.com/watch?v=Fg_JcK...
We value content like this one! Continue posting! https://www.windowcleanersburnaby.com
Write your own review or comment: