Computability And Incompleteness » Hotfile, Filserve, Filesonic & Rapidshare Downloads

• Win7dl.com Downloads » E-Books » Computability And Incompleteness

Computability And Incompleteness

(Votes #: 0)

Computability And Incompleteness

English | FLV 1024x768 | MP3 48 Kbps | 176 MB

Genre: eLearning

Author:Errol Martin, EP Martin Consulting

In these lectures we cover the following topics: Computability and Recursive Functions, Proof that exactly the partial recursive functions are computable, Godel’s Incompleteness Theorems, Lob's Theorem.

These very deep and very powerful results in metalogic from the 1930s were unexpected. They arose in a context in which it was expected that a finitary proof of consistency of arithmetic would shortly be forthcoming. This followed the proposal by the mathematician David Hilbert (1862-1943) for the complete axiomatisation and formalisation of all mathematical knowledge and proofs. Although committed to formal methods, many of Hilbert’s proofs were existential in nature, which ran counter to the finitistic, constructivist methods of mathematics. To deal with this criticism, Hilbert proposed that the formal methods program should establish that all of the “Ideal” existential arguments could in principle be replaced by “Real” constructive arguments, by showing some sort of conservation result. However, the incompleteness results showed that this ‘program’ could not be carried out in a simple way.

0:00 Godel's Remarkable Theorem

3:48 Metalogic

5:55 Lecture Topics

6:56 References

8:57 A Brief History

12:10 The Great Quest: Hilbert's Consistency Program

13:24 Hilbert's Response

16:06 Consistency - Conservation

17:21 Godel's Incompleteness Theorem

21:41 Formalisation of Arithmetic

25:10 Godel's Second Incompleteness Theorem

26:08 - Formalisation of Arithmetic - Part 2