jsbgir

3 ms·

1. 1.▲
   by jsbgir 12y ago

   The set of transcendental but computable numbers is also countable, however: there is a countable number of algorithms. Therefore, the majority of the reals are uncomputable, like Chaintin's constant (the probability that a random algo
2. 2.▲
   by jsbgir 12y ago

   I can't recommend the Pimsleur language courses enough. They teach languages in a way that's similar to how a toddler learns to speak - by going from sounds to words, and by gradually expanding your lexicon while jogging your memo
3. 3.▲
   by jsbgir 12y ago

   > For example, if you want to delete 3 words, there is an action to delete (d) and a motion to move forward one word (w): 3dw (read (3) times, (d)elete (w)ord) I prefer to use d3w since it feels more like English. It's also more com
4. 4.▲
   by jsbgir 12y ago

   This is really interesting. We could take it further and say that, given that some uncomputable reals have a finite definition (e.g. "the probability that a random algorithm halts"), there is a countable number of definable reals