Software Engineering discussion

12 views
Gödel, Escher, Bach > CHAPTER XIV: On Formally Undecidable Propositions of TNT and Related Systems

Comments Showing 1-3 of 3 (3 new)    post a comment »
dateUp arrow    newest »

message 1: by Erik (new)

Erik | 165 comments The first half of this chapter was extremely challenging to read and follow. The second half was much easier to follow. I liked the Proof Pair concepts, but then I started to get lost when the example walkthroughs were happening. I think that I understood the main points and walkthrough of the Godel numbering and TNT introspection, but I definitely would not be able to apply this chapter if asked to take a test on it.


message 2: by Erik (new)

Erik | 165 comments I remember really liking the spot in this chapter where the author states that Proof-Pair-ness can be tested with a BlooP program. I was looking for uses or references to those program classifications, but I don't think I would have been able to identify them with out the authors help.


message 3: by [deleted user] (new)

Gödel's proof is difficult. I read this outstanding little book, and it helped me understand it better than the GEB book.

http://www.amazon.com/Godels-Proof-Er...


back to top