Re: help proving decidability of a set

Precisely! The TM I described _is_ a decision procedure. I.e., it is
a total function over naturals that accepts a natural and always says
"yes" or "no" with a well-defined, finite computation. If you call the
input i, then D(i) is a good way to abbreviate this function.

.