We consider the development of computability in the 1930s from what we have called the formalism free point of view. We employ a dual conceptual framework: *confluence* together with *grounding*.

In Gödel’s view, the Turing analysis of computability grounded that notion.

We follow that idea forward, through to Gödel’s introduction, in his 1946 Princeton Bicentennial Lecture, of the concept of ordinal definability in set theory. In particular we trace the influence of Turing’s analysis of computability on the provisional program for definability and, to a lesser extent, provabilityprovability
laid out in that lecture by Gödel.