this post was submitted on 12 Aug 2023
229 points (100.0% liked)
196
16224 readers
3935 users here now
Be sure to follow the rule before you head out.
Rule: You must post before you leave.
founded 1 year ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
the model provided is a lazy cauchy sequence so any given real number can be computed to arbitrary precision. the theorems about real numbers are directly provable and potentially machine checkable, assuming decidable type checking works out.
Nothing about what you said contradicts what I said. You can either change the definition of the computable real numbers, or agree that they are countable.