On 14 Dez., 00:49, Virgil <vir...@ligriv.com> wrote:
> WM's allegedly complete infinite binary trees are never incomplete.
Correct.
> Every subset of N should correspond to a different path, the one > branching left at just those levels whose numbers are in the set, and > right at all other levels.
Correct.
> and N has more subsets than WM's tree has > paths.
Then tell me one single subset/path that is missing after I have constructed the CIBT by means of all finite paths with the ending xxx... (to be published after you will have announced your finding).
