we only need a subset of the formal languages: only computable models ("the stuff that works") are adequate.
-
-
/1 that's the intriguing part for me. - Gödel: formal lang. := undecidability - "stuff that works" := decidability
-
/2 => "stuff that works" actually based on formal lang. for which undecidability is shown = contradiction where is my flaw?
- 4 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.