Recall that cantor diagonal argument basically asked to list out the table of all countable binary strings, and showing how regardless of what list you start with, there's always a diagonal element that is not enumerated in the list, thus proving the reals have larger cardinality.
\begin{matrix} 00001...\\ 10101...\\ 11001...\\ 11000...\\ 11010...\\ \vdots \\ \text{pick}: 00000\\ \end{matrix}
But suppose we iterate this process as follows:
- Start with a list of binaries
- Use the diagonal argument to pick out the diagonal element that is not in the list of binaries
- Place the new element at the beginning of the list of binaries
- Repeat until no new diagonal can be picked out.
Since this is expected to iterate indefinitely, can a proof by transfinite induction allow us to deduce whether such procedure can enumerate all countable binary strings. what is the step required to set up this proof?
Alternately, since any algorithm in a computer can only run for finite number of steps, what is the approach used to find a counterexample of this conjecture?
You're not gaining anything new by this method. If it terminates, you just end up with a standard list, and you already know how to prove that that can't be complete. If it doesn't terminate, it produces a "two-sided list", infinite in both directions, which you can easily map to a standard list by cutting it at some point and interleaving the two resulting lists. So again you already know how to prove that this can't be complete.