Revision sequences and computers with an infinite amount of time (Q2720396)

This interesting paper investigates in great detail the following question: What sets of natural numbers can be defined using a definition of Gupta-Belnap type? Recall that first-order definitions using the second-order induction scheme are neither sufficient for technical discourse (e.g., science) nor for technical applications using computers to check properties (e.g., the idea of connectedness for a finite graph is not first-order definable). In the investigative process, an applicable formal relation is developed between infinite-time Turing machines in the sense of Hamkins and Lewis and Revision Theory of Truth in the sense of Gupta and Belnap. As a result, complexity-theoretic concepts and results are applicable to the Revision Theory of Truth.