In this thesis I will look at a definition of computable randomness from Algorithmic Information Theory as defined by Andre Nies through the lens of Computable Analaysis asdefined by Klaus Weihrauch. I will show that despite the fact that these two paradigmsgenerate distinct classes of computable supermartingales, the class of...