In article <2c837009-68a3-477d-85cd-555a8255fea9@q16g2000yqn.googlegroups.com>, WM <mueckenh@rz.fh-augsburg.de> wrote:
> On 30 Okt., 12:52, William Hughes <wpihug...@gmail.com> wrote: > > > > > > > To my mind this means d_oo=(1,2,3...) is discernable. > > > > > > So what do you mean by "d_oo represented in a > > > > > > discernable manner"? > > > > Please answer the question; > > use the term "discernable manner" in your reply. > > It is a pleasure. > > A number is represented by a string of digits in a discernable manner > if its value can be obtained in a finite number of steps.
Limits of infinite processes can often be determined in a finite number of steps > > Whether the Binary Tree contains the path of 1/9 is not discernable > from its nodes.
A binary tree does not contain anything but nodes, though a complete infinite binary tree will contain at least one path representing any real between 0 and 1.
