If you’re interested in learning about recursion theory and the Godel incompleteness theorem, these lecture notes by Jeremy Avigad are terrific. In this approach, incompleteness follows from properties of algorithms, which I think is the clearest approach.