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

A colleague quotes these theorems to argue nothing can be verified about software

I work on numerical code and this comes up whenever verification is discussed. The theorems concern what certain formal systems can prove about arithmetic sentences, including ones about themselves; they do not say that specific properties of specific programs are beyond reach. The name is being used to close a discussion rather than inform it.
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.