|
|
libcats.org
On Formally Undecidable Propositions of Principia Mathematica and Related SystemsKurt GödelIt is very hard to find faults in what may be the most famous proof of the 20th century.
For those not familiar with the Russell-Whitehead Principia Mathematica notation this is a very hard book. I had the benefit of the Kac-Ulam explanation. I did find what might be problems with this proof. 1) One is the reliance on number theory proofs about prime numbers that are assumed true in the Gödelization of the primes coding of the mathematical axioms. 2) The second is the assumption that the axioms statements represent the minimal representation of such a system of axioms. Both are slim if none chances, but ones the Gödel doesn't consider. Information theory was after this time where we discovered that a system of symbols can indeed at times be more efficiently coded. The best example of this seems to be Gray code compared to ordinary binary number code ( a number theory code like Gödel's prime code) where less turns out to be more in information terms. The theory of primes suffers from the new doctrine of strings that says that infinite scales don't exist in the "real" world: that a maximum and a minimum of measure are fixed parts of our reality. This kind of assumption can't be "proved" but is an axiom of a system of a mathematical sort and is counter to the Euclidean proof of an infinite number of primes. Primes already discovered by use of computers are much bigger than the numbers of ordinary physics, but we are already reaching the Turing "stopping" problem in finding new ones. Some people equate in algorithmic information theory and number theory the stopping problem with Infinity. That point of view of people like G. J. Chaitin is itself an unproved assumption. So the metamathematics used in the proof itself may be unprovable propositions. If so, then the proof based on such propositions can't itself be true. This argument in no way takes away from the greatness of Gödel and his unique genius as shown by this line of reasoning.
Скачать книгу бесплатно (pdf, 3.98 Mb)
Читать «On Formally Undecidable Propositions of Principia Mathematica and Related Systems» EPUB | FB2 | MOBI | TXT | RTF
* Конвертация файла может нарушить форматирование оригинала. По-возможности скачивайте файл в оригинальном формате.
Популярные книги за неделю:
Система упражнений по развитию способностей человека (Практическое пособие)Автор: Петров Аркадий НаумовичКатегория: Путь к себе
Размер книги: 818 Kb
Сотворение мира (3-х томник)Автор: Петров Аркадий НаумовичКатегория: Путь к себе
Размер книги: 817 Kb
Только что пользователи скачали эти книги:
Половое покрытие (первоначальный вариант)Автор: Пресняков Владимир, Автор: Пресняков ОлегКатегория: Драматургия
Размер книги: 70 Kb
Аналитическая химия элементов. АктинийАвтор: Каралова З.К., Автор: Мясоедов Б.Ф.
Размер книги: 1.67 Mb
Свой хлеб. Удивительное искусство и простое удовольствиеАвтор: Ришар Бертине
Размер книги: 19.81 Mb
Радиолюбительские карманные приемники на транзисторахАвтор: Зотов Владимир ЕмельяновичКатегория: АППАРАТУРА, ПРОФЕССИИ И РЕМЕСЛА
Размер книги: 1.19 Mb
Family & Matrimonial (NVQ) (Legal Support Practitioner Series)Автор: Tarassenko, Автор: Sophie Tarassenko, Автор: Elissa Da Costa, Автор: Richard NorrieКатегория: Домоводство, досуг
Размер книги: 9.19 Mb
The Next Generation of Electric Power Unit Commitment Models (International Series in Operations Research & Management Science)Автор: Benjamin F. Hobbs, Автор: Michael H. Rothkopf, Автор: Richard P. O'Neill, Автор: Hung-po Chao
Размер книги: 10.88 Mb
assortment of articles from The Journal of Imperial and Commonwealth History, The International History Review, Capitalism Nature Socialism, Journal of Modern Chinese HistoryАвтор: Robert J. Blyth , Автор: H.V. Bowen , Автор: Hsiao-Ting Lin , Автор: Ramachandra Guha , Автор: T.R. Moreman , Автор: Alexander Morrison
Размер книги: 259 Kb
|
|
|