Is there any link between Turing machines and proof theory?

122 Views Asked by At

I was told (in an informal way) that there exists a close link between Turing machines (or recursive functions, which amounts to the same) and proof theory in the sense that any formal proof can be "expressed" by a Turing machine. To my knowledge such a relationship does not exist, could you please confirm or refute this ?