Waiting for Gödel
newyorker.com
newyorker.com
https://www.logicomix.com/
https://en.wikipedia.org/wiki/Logicomixhttps://www.amazon.com/review/R3FH3WXNKEOZR9/ref=cm_cr_dp_ti...
> “There is more to truth than can be caught by proof.”
That's a nice way of putting it.
How do people day to day deal with ambiguity, where the truth is uncertain or unknowable?
The default action always is - they choose the truth they want to be true. And this has long term consequences. They should develop self awareness that it is a chosen truth and feel a sense of responsibility for its consequences.
The example I given students when I teach where things worked out well, is Thomas Jefferson's - "We hold these truths to be self-evident, that all men are created equal".
We still know 240 years later there is nothing self-evident or truthful about equality. We don't know if it will ever be.
Jefferson knew that. Yet he made a choice about what he wanted the truth to be. We face similar choices everyday in life. Choose well.
http://www.w-k-essler.de/pdfs/goedel.pdf
Here's an English translation (with a lengthy introduction)
http://jacqkrol.x10.mx/assets/articles/godel-1931.pdf
Even without trying to follow the proof proper, the sub-sections of the second part are interesting on their own, particularly Gödel numbering and primitive recursive functions. Here is another translation that covers just this part:
http://www.research.ibm.com/people/h/hirzel/papers/canon00-g...
It's true that if you know nothing about formal logic, history of metamathematics, and decidability, then it's going to be particularly hard going, but there are a lot of accessible resources for each of those topics and the paper is well structured (meaning you can concentrate on the pieces).
The encoding that Gödel used for formulas should be fascinating for anyone familiar with Turing work on decidability as well as how computers work generally. Primitive recursive functions don't handle computation generally, but seem to be a first step in understanding what it means. Anyone familiar with Alonzo Church, lambda calculus, functional programming, McCarthy's first paper on Lisp would probably be interested in this bit.
Of course, Gödel's result on formal systems shattered the idea of an axiomatic basis for mathematics, but I personally think its greater long-term impact is helping to usher in computation. It's worth recognizing both.
That said, I'm very glad that the idea is finally popping up in the popular press: incompleteness, like special relativity & quantum superposition, is about a hundred years old & many people still don't have sufficient familiarity with it to understand the way that the philosophy of the field in appeared in was impacted. Where relativity meant that time was mutable & superposition meant that randomness was inescapable (in other words, breaking the "Newton's Calculator" model of physics), incompleteness means that self-description breeds undecidability & that the relatively common idea of an ultimate descriptive language is inherently doomed. These are important facts from a philosophical standpoint, even if they rarely directly interact with things that 'normal' people are trying to do (although 'normal' people bump up indirectly against relativity & incompleteness daily, in the form of (for instance) GPS devices).
I have the Brooklyn Institute for Social Research in my Facebook feed and they're mentioned in the article. I think the point of the article is to mark the work the teacher of the Godel class at the Institute did to digest the material for the students of his/her class.
The preliminary milestone of digestion of a subject for teaching is a syllabus, also mentioned in the article.
Rudy Rucker was/is also one of the most prominent cellular automata researchers of recent history. I can highly recommend "Cellab" [1], which I first encountered as CA Lab. You may need to install a virtual machine to get it running properly [2].
[1]: http://www.rudyrucker.com/oldhomepage/cellab.htm
[2]: [In the spring of 2010, the Cellab software became semi-obsolete---in that it won't run under Windows 7. The "good" news is that Windows 7 can in fact run a virtual machine in Windows XP mode, if you download and install some free Microsoft virtual XP software. I tried this just now, and it works pretty well. You get a little window or a full screen which is an XP desktop. And CELLAB runs fine in the XP window—to make it easy to find your files, you drag the CELLAB folder from your normal C: drive (if that’s where it lives) onto the desktop of the XP Virtual machine window.]
Probably worth mentioning that Russell's opposition to recursion which lead to him formulating "his" paradox offered type theory as a solution. Type theory also has quite the impact on computer science.
For example, it's fine to define an arithmetic function recursively; it's not so fine to define a set based on whether it contains itself.
nitmode: theorems (there's two). It's mentioned later in the article but a little odd that they don't just add the s and be done with it.
Great article though. Sidenote: I always thought a tragedy about Cantor would be fun to write.