  We give a quick survey of the various fixed point theorems in computability
theory, partial combinatory algebra, and the theory of numberings, as well as
generalizations based on those. We also point out several open problems
connected to these.
