Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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!

share|improve this question
2  
(1) Looks like an exercise in a book. If this is the case, it is better to state the source. (2) What is n? (Well, I know what n is but you should make it clear in the question.) –  Tsuyoshi Ito Sep 28 '10 at 10:26
3  
There's a bit of overlap into math, but I suspect this question might be even more interesting to the folks over at Stack Overflow. Have you tried asking there yet? –  Carl Smotricz Sep 28 '10 at 11:58

1 Answer 1

What is n here? Is it no .of digits or the value of the number?

If it is the value of the no,, then just convert each digit of base-9 no. in to its base-3 equivalent.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.