I recently made an edit to this post concerning $\pi$ and it containing all possible combinations of numerical values; and this answer to it brought forward an interesting number:
0.011000111100000111111…
This got me thinking; what is it called when a number has a pattern that can be replicated infinitely, though the same number never repeats. The best example is the above referenced nuber; when this is broken down:
0, 11, 000, 1111, 00000, 111111
Granted even this is not a perfect example as zero
and one
are repeated which breaks the same number never repeats rule if you take it that far; this would mean that further definition is required.
I suppose a thorough definition would be more of:
A number whose digits represent a pattern that can be scaled infinitely, without repeating grouped digits such as:
10110111 - zero repeats, not a true resemblance.
011000111100000111111 - zeros are grouped, true resemblance.
The Question at Hand: what is it called when a number has a pattern that can be replicated infinitely, though the same number never repeats.
We say that the digits of x have a weak pattern in base b if there's a polynomial time algorithm in n to compute the nth digit in base b.
Note that a weak pattern is very weak and may not even be obvious. It may make sense to use a more narrow computational complexity class, like say insist that the calculation time be O(n). Another option would be to declare that the digits should correspond to an automatic sequence https://en.wikipedia.org/wiki/Automatic_sequence .
– JoshuaZ Aug 13 '18 at 21:05