From raw Solvability Complexity Index proofs to Weihrauch degrees

The Solvability Complexity Index (SCI) provides an extensional limit-height formalism for recovering a target map $\mathrm{\Xi }$ from finite samples of an evaluation interface $\mathrm{\Lambda }$ by finite-height towers of pointwise limits. At first sight this sounds like a typical Type-2 question, so it seems natural to ask how deep and rich the connection of SCI approximation questions and Type-2 computability questions is. This note aims to explain this connection further with explicit examples mostly from the literature.