Howard Brenner

]]>Thanks for catching this! We’ve updated the article.

]]>But, Turing wrote exactly the opposite in his article: “A number which is a description number of a *circle-free machine* will be called a satisfactory number”.

A circular machine being a machine that gets stuck or loops forever without printing symbols of interest (aka “figures” in Turing’s article).

]]>https://archive.bridgesmathart.org/2010/bridges2010-111.pdf

Gerdes has other relevant papers.

]]>