User blog comment:LittlePeng9/Random Turing machines/@comment-5150073-20130402161217

I also have an idea for square root: we can just calculate 1^2 first, then if n>1^2 (need comparison program), calculate 2^2, then 3^2, until you get n<m^2, although your program should work faster than my. Even my division algorithm requires 15153 steps to perform 100/2.