True: Rendell's work, though most impressive, is not a true Turing machine because its memory is only arbitrarily large, not infinite.
One could fix it by replacing the tape (stack) with one that extends itself and does not require a pre-existing pattern. It is theoretically possible to build such a tape (using a universal constructor if nothing else), but no efficient method of doing it is known.
Slashdot Mirror
One could fix it by replacing the tape (stack) with one that extends itself and does not require a pre-existing pattern. It is theoretically possible to build such a tape (using a universal constructor if nothing else), but no efficient method of doing it is known.