(Conway).There exists a particular, explicitly constructible function such that is periodic for a finite modulusdand takes rational values, for which there is no Turing machine that, when givenn, always decides in a finite number of steps whether or not some iterate with is a power of 2.