4 ms·
I saw the title and thought, "Oh good, someone else who thinks like Dijkstra!" Oh well. :-) I feel like the halting problem and Godel's theorem imply programme
by pjungwir 12y ago
I saw the title and thought, "Oh good, someone else who thinks like Dijkstra!" Oh well. :-)
I feel like the halting problem and Godel's theorem imply programmers will never be out of a job, and the best we can do is build out more and more solutions for specific use-cases, like Wordpress and Shopify. I don't think there will ever be a general-purpose AI that can write computer programs. At least not in my lifetime or my children's.
And btw, has anyone else felt that the Halting Problem and Godel's theorem are two sides of the same coin? Is there any formal connection between them? I feel like they are not "independent" (in the sense that Euclid's 5th postulate is independent).
- ruggeri 12y agoHaha, the first thing I thought was that this was Dijkstra. UTexas + "Foolishness" => Dijkstra.
- arketyp 12y ago>And btw, has anyone else felt that the Halting Problem and Godel's theorem are two sides of the same coin? Is there any formal connection between them? I feel like they are not "independent" (in the sense that Euclid's 5th postulate is independent). The theorem of the unsolvability of the halting problem is used in modern proofs of Gödels incompletness teorem(s) [1]. Hofstadter writes about this relation in Gödel Escher Bach as well. [1] http://www.amazon.com/Lectures-Logic-Set-Theory-Mathematical/dp/0521168465 http://www.amazon.com/Lectures-Logic-Set-Theory-Mathematical...
- quinnchr 12y agohttp://en.wikipedia.org/wiki/Halting_problem#Relationship_with_G.C3.B6del.27s_incompleteness_theorems http://en.wikipedia.org/wiki/Halting_problem#Relationship_wi...