Connections of theory of computability and Turing machines to other areas of mathematics The question is quite straightforward:
Could you point out some reference papers that highlight (in a way that is fairly accessible) the connections between (1) theory of computability, algorithms, and Turing machines and (2) other areas of mathematics.

You can consider Computability and Complexity :

[for the] study and classification of which mathematical problems are computable and which are not. In addition, there is an extensive classification of computable problems into computational complexity classes according to how much computation — as a function of the size of the problem instance — is needed to answer that instance. 

See e.g. :


*

*Sanjeev Arora & Boaz Barak, Computational complexity :  A Modern Approach (2009)

*Pavel Pudlak, Logical Foundations of Mathematics and Computational Complexity (2013).
And also Computable Analysis i.e. :

is the study of mathematical analysis from the perspective of computability theory. It is concerned with the parts of real analysis and functional analysis that can be carried out in a computable manner.

See e.g. :


*

*Klaus Weihrauch, Computable Analysis : An Introduction (2000) [and also here].

