The uniform halting problem (UH) can be stated as follows.
Give a decision procedure which for any given Turing machine (TM) will decide whether or not it has an immortal instantaneous description (ID).
An ID is called immortal if it has no terminal successor. As it is generally the case in the literature (see e.g. Minsky [3, p. 118]) we assume that in an ID the tape must be blank except for some finite numbers of squares. If we remove this restriction the UH becomes the immortality problem (IP). The UH should not be confused with the initialised uniform halting problem (whether or not a TM has an immortal ID when started in a specified state) which can easily be shown to be undecidable (see e.g. Minsky [3, p. 151]).
Email your librarian or administrator to recommend adding this journal to your organisation's collection.