This open access academic publication presents new results in the foundations of mathematics and computer science. A method for solving the Turing Immortality Problem is presented in section 8 based on the mathematical results in sections 1 through 8. In section 9, a dynamic register machine is defined as an extension of the register machine. In section 10, the design of the immortal dynamic register machine program is explained. In section 11, the immortal dynamic register machine program composed of 1590 dynamic register machine instructions is presented that can determine in a finite number of computational steps whether a given Turing machine has any immortal configurations.

Caveat: there is a mistake in section 8 in the way that this section interprets the main results from section 4. Accordingly, the tentative disproof of Church’s thesis put forward in section 8 is not correct. However, the author believes that the rest of the supporting mathematical work presented herein is correct. The author intends to update section 8 and dependent parts in sections 9 through 11 when time allows.