if there is a unique infinite string S on which D doesn’t terminate, then S is computable.
That looks true, though the process you describe only works if S is indeed unique, othwerwise it gets stuck.
That looks true, though the process you describe only works if S is indeed unique, othwerwise it gets stuck.