I am currently working on my Bachelor thesis about Turing Categories (see Introduction to Turing Categories ). In this context I got some questions regarding Partial Combinatory Algebras (PCAs), which I want to get out here, as neither of my supervisors could help me.
In Total Maps of Turing Categories  necessary and sufficient conditions for a category to appear as subcategory of total maps of some Turing category are given. As a corollary, the category of PTIME-functions, LOGSPACE-functions, LTIME-functions etc. can appear as total maps of some Turing category. Does this imply that these classes can be characterized by a specific PCA and (if so) how does it relate to Kleene's first model? In other words, are there complexity classes which can be represented by sub-PCAs of Kleene's first model?
Are there models of PCAs which are not a priori inspired by computability theory? The general setting of applicative system and computable function (see  section 4) seems to be rather general such that it may be applicable in general categories. However all my attempts to find a PCA in categories like Top, K-Vec, R-Alg, R-Mod etc. have failed. I am well aware of Kleene's second model, Scott's graph model and the $\lambda$-calculus as they are stated in Realizability - An Introduction to its Categorical Side . I am just curious whether this notion of computability naturally arises anywhere else in ordinary mathematics...
I hope anybody can help me out. No matter what, thank you all for your time.