On Thu, Sep 13, 2012 at 10:36 PM, Joe Niederberger <firstname.lastname@example.org> wrote: >>The tree "paradox" is a standard technique/idea in set > theory and logic, and a good starting point for those > interested would be to google "infinite binary tree" > and "binary tree" AND "real numbers". > > The "infinite binary tree paradox" I can read about focuses on the cardinality of paths versus vertices. I could have been much clearer, but I am asking something different: if the algorithm is outputting all real numbers between [0,1], (or [0,10] etc. take your pick) then how can some/most of these be called "non-computable"? > > Joe N >
I don't see any "algorithm", I see a messy drawing in a notebook, like something Vi Hart might draw in one of her Youtubes.