
Re: Computing pi (or not)
Posted:
Sep 14, 2012 1:36 AM


>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 "noncomputable"?
Joe N
 End of Forwarded Message

