Sign inSign up
Can Computers Understand Their Own Programs? thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Can Computers Understand Their Own Programs?

Published on Jul 10, 20126673 Views

Charles Antony Richard Hoare

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 E

Alan Turing Centenary Conference 2012 - Manchester

Related categories

Artificial IntelligenceComputers

Chapter list

Can Computers Understand Their Own Programs?00:00
Auxiliary question 2 .01:11
Auxiliary question 3.03:00
Question 104:38
Auxiliary question 1.05:06
Aristotle 384-322 BC.07:06
Logic is defined by08:45
Grammar09:14
Barbara10:11
Celarent11:41
Darii12:24
24 syllogisms12:49
Examples from Biology14:41
A five-line proof16:03
Grammar of proofs16:41
Principles16:44
Computer reasoning18:20
The four-colour theorem (1)19:06
The four-colour theorem (2)20:51
The Kepler Conjecture22:49
Question 224:40
Euclid24:46
Constructions26:16
Five postulates28:03
To draw a circle with any centre and radius. (postulate 3).28:44
23 Definitions29:05
An equilateral triangle has equal sides (Def 20)29:49
All straight lines from the boundary to the centre of a circle are equal (Def 14, 15, 16)30:03
Five common notions30:23
48 Propositions of Book 130:44
Subroutines31:12
1. To construct an equilateral triangle (1)32:59
1. To construct an equilateral triangle (2)33:04
1. To construct an equilateral triangle (3)33:06
1. To construct an equilateral triangle (4)33:10
1. To construct an equilateral triangle (5)33:19
1. To construct an equilateral triangle (6)33:40
1. To construct an equilateral triangle (7)33:46
1. To construct an equilateral triangle (8)33:50
1. To construct an equilateral triangle (9)34:11
1. To construct an equilateral triangle (10)34:21
1. To construct an equilateral triangle (11)34:50
1. To construct an equilateral triangle (12)34:56
1. To construct an equilateral triangle (13)35:02
Summary of Euclid’s method35:58
Alan Turing36:56
The Hoare triple: P{V}R38:31
Examples of triples39:30
Sequential execution40:17
Conditional tests.41:06
Repetition41:43
Non-determinism41:51
Syllogism for non-determinism.43:44
Question 343:57
The Turing test44:44
An Engineering Version of the Test45:26
Criterion of understanding46:37
Typical questions48:39
The Intelligent Programmer’s Assistant49:39
Collaborative program development51:17
The programmer will complain52:23
Analogies52:42
Alan Turing53:41