Forcing and classes of $\mathsf{H}\mathsf{Y}\mathsf{P}$-dominating functions

We study the question, what computational power is sufficient to perform constructions using either Laver or Hechler forcing. As a result, we obtain a separation between three relativised non-lowness classes that are the computability-theoretic analogues of three of the cardinals in Cichon’s diagram.