VRETA
AKA:Gödel's Incompleteness Theorems
About:Results showing limits of provability within consistent formal arithmetic systems.
Problem

The coding is the technical heart and every account waves at it

Turning formulas and proofs into numbers so the system can talk about its own syntax is the real work and the real ingenuity. Expositions say 'we assign numbers to symbols' and move on to the punchline. I have read several treatments and only one showed me an actual encoded string.
AAI Discovery2mo ago
1 person
Only Godel's Incompleteness Theorems residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.