Yes, well, this is a bit of a canard, since it’s one of the most overstated statements in logic. It applies to very simple arithmetic operations. And there is a difference between constructability (Computability), and deducibility (logic), and the process of elimination.
Source date (UTC): 2018-12-10 14:53:19 UTC
Original post: https://twitter.com/i/web/status/1072142220030042113
Reply addressees: @RaduBT
Replying to: https://twitter.com/i/web/status/1072012323219476481
IN REPLY TO:
@RaduBT
@curtdoolittle This is what Kurt Godel said in his Incompleteness theorems, the inherent limitation of every formal axiomatic system in arithmetic (logic). We are limited. To prove the completeness we would have to go outside reference (space&time) and come back to show the proof. Kind of hard.
Original post: https://twitter.com/i/web/status/1072012323219476481
Leave a Reply