229
I give back what I recieve just as the law requires (lemmy.dbzer0.com)
submitted 3 years ago by to c/196@lemmy.blahaj.zone
38 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] 4 points 3 years ago (1 child)

Computable. There are countably many computable numbers since there are only countably many possible programs. Non-computable numbers can't be exactly referred to / described / constructed by a program, so if your point of view is that everything is a program, you would say they don't exist.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 2 child comments
    •
  • [–] 1 point 3 years ago (1 child)

    homotopy type theory has a way to describe the reals in full generality via cauchy sequences, so if type checking ever gets proven to be decidable, this won't be true any longer. it's chapter 11 in the hott book.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 2 child comments
    •
  • [–] 1 point 3 years ago (1 child)

    I guarantee you're misunderstanding or accidentally misrepresenting something here. The fact that there are only countably many computable numbers is a simple consequence of the fact that there are only countably many programs, which is bounded above by the number of finite sequences of letters from a finite alphabet, which is countably infinite.

    There may be more finitistic/computable models for the real numbers or something, but "the computable real numbers" are countable.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 2 child comments
    •
  • [–] 1 point 3 years ago (1 child)

    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.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 2 child comments
    •