TLDR; Gödel’s incompleteness theorem rests on recursive functions which can be expressed as looping programs, i.e., for() loops. Dennis Ritchie’s PHD thesis, which was never accepted by Harvard because he refused to pay for a bound copy required for submission, demonstrated that the complexity of looping programs is determined by the degree of nesting.

Ritchie did not seem to be driven by status seeking but instead by the urge to build things.