Warning: Some posts on this platform may contain adult material intended for mature audiences only. Viewer discretion is advised. By clicking ‘Continue’, you confirm that you are 18 years or older and consent to viewing explicit content.
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.
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.