There are many steps. You have a set of different Turing Machines with alphabet {0,1}, each of which has, say, 4 states. You want to know which of these is the one that, starting from a tape filled with 0's, can write the largest number of consecutive 1's onto the tape, before it halts. If it halts - you don't know that in the beginning. A human can find out, by manually simulating the sequence and counting the steps. It's a lot of work - there are 61.519 possible 4-state machines -, but Bringsjord (or more likely, a group of undergrads available to him) has/have done it. A computer can't do it. For details, please read the paper.