So I have an introductory knowledge of category theory but there is one concept I can't get my head around and would like some help:
When my class had categories defined we said a category $\mathcal{A}$ is a collection of objects (not necessarily a set) and for every two objects $A, B$ there is a set Hom($A$,$B$) that are all the morphisms (arrows) between the two objects.
I was getting along fine with this until my professor mentioned that we cannot have a category of categories. He said we could certainly look at the collection of all categories but given two categories the functors between them may not form a set thus violating our definition. So this is where my confusion is. I understand that not all collections can be sets, i.e. under general set theory we cannot have a set of all sets that don't contain themselves (Russell's Paradox). But I don't quite see what is wrong with having a set of all functors between categories.
I'm well aware that there are things called Higher categories that allow my Hom space be a category on its own right and this would allow me to form a higher category of categories or some such (I'm not very familiar with this area, but it's also not quite what I'm asking at the moment).
So if possible I would love an example (or an explanation of) two categories where the collection of functors between them cannot be a set. I spoke to my professor about it but he pretty much just said it can lead to paradoxes, but I don't see how.
Any help is appreciated, Thanks