Is there a computable infinite sequence of bits, and a constant c>1, such that any algorithm that prints the sequence requires at least c^n time to print the nth bit?
Is there a computable infinite sequence of bits, and a constant c>1, such that any algorithm that prints the sequence requires at least c^n time to print the nth bit?