We study the uniform computational content of Ramsey’s theorem using both Weihrauch reducibility and a new variant of Weihrauch reducibility, where the functions in the reduction are required to be total. In the latter setting, we show that the strength of Ramsey’s theorem varies significantly depending on how one represents its solutions, for example, using characteristic functions or using enumerations. Some of our results extend beyond variants of Ramsey’s theorem. In particular, we show that $\mathsf {RT}^{2}_{2}$ where solutions are represented using characteristic functions is not totally Weihrauch reducible to any computational problem whose solutions are represented using enumerations. Next, we study the computational problems $\mathsf {RT}^{n}_{\infty }$ which take as input a colouring of n-tuples which has some infinite homogeneous set and asks for any such set. The problem $\mathsf {RT}^{1}_{\infty }$ is fairly well-studied, as it is Weihrauch equivalent to the cluster point problem on $\mathbb {N}$. Our main result shows that $\mathsf {RT}^{1}_{\infty }$ is not Weihrauch reducible to $\mathsf {RT}^{2}_{\mathbb {N}}$, strengthening a result of Soldà and Valenti. We also show that the jump of $\mathsf {RT}^{1}_{\infty }$ is Weihrauch equivalent to $\mathsf {SRT}^{2}_{\infty }$.