Greetings, dear Mathematicians!
How to implement base-9 to base-3 conversion in O(log(n)) on 4-tuple ((stateFrom, encounterWhat, Command, StateTo), where Command can be < (turn left), > (turn right), # (stop execution), or symbol from an alphabet) Turing machine, finite from the left side and infinite from the right side?
Thank you for your answers!