Sammendrag
We show that to every recursive total continuous functional there is a total functional below it that is S1-S9 computable in the hierarchy of partial continuous functionals, or equivalently, that is PCF-definable in the same hierarchy. Here PCF is Plotkin's programming language for computable functionals. This means that we can avoid the use of non-deterministic parallel operators without loosing totality.