Example of Turing machine for 0^2^n where n greater than equal to 0

Theory of computation and automata example Turing machine for 0 pow 2 pow n where n greater than equal to 0.best way to solve.
To buy costly items in best deal price join this telegram group (only for india)
t.me/hotdealsA...

[@asifiqbal94]

please explain the logic behind this method, how did u figure out that u had to use alternate X and 0's with the first 0 being blank?

[@ilmulehsaan]

sir if you want 0^3^n+1 and n>=0 ??

[@arinmahapatro61]

The concept it is based on is 1+2+2^2+...+2^n-1=(2^n)-1.....Hope that helps -:)

[@n0ne0ne]

roses are red violets are blue the title is english but not you

[@howtodothisofficial]

Roses are red, violets are blue, if you can't understand Hindi, it's not my issue.

[@n0ne0ne]

@@howtodothisofficial don't put English title if you speak pajeet

[@debashishtiu2919]

GREAT VIDEO

[@MahimDashoraHackR]

it accepts n=6,10 . it can't accept these values ,what do we do?

[@techdev4180]

thanks Devanshu sir

[@pratickmazumder8379]

this video was all about "ye krdiya wo krdiya" no explanations

[@howtodothisofficial]

Sorry to hear that, actually this video created long back to help the people with this question, we apologize that we were unable to explain this in depth. In future will try to explain as much as we can, thankyou for watching this video.

[@Pilii94]

you need to explain
pleaseee

[@vikashraj2561]

sir i want your help for exam plz give email id to send some question plz hepl sir my exam is 7 july 2017 .only 4 numerical probleam plz sir

[@gauravghosh6562]

it's wrong

[@howtodothisofficial]

What's wrong in this?