Assuming scratch runs on a Garison Machine (look up on googology wiki as I'm too lazy to explain it fully here), this is entirely within actual physical possibility. Without assuming this would map to somewhere within the Buchholz's Psi hierarchy.
**Credits to Iso for Defining and Sharing the Concept of Garison Machines Garison Machines are defined within googology blogs as a *rigorous concept*, they however lie an a area within theorem that is mainly understudied and is therefore not an entirely well-defined variation of a Turing Machine. Garison Machines being described as the intermediate step between the computable and uncomputable as it shares characteristics of normal Turing machines and Oracle Machines without having "full Oracle Power", although Garison Machines contain an encryption Oracle and a Oracle of degree 0'. A Garison Machine cannot solve its own halting problem, however it can solve the halting problem for lesser Machines/Machines with less theoretic power.
