early Turing computer science models were founded in crypto rotor machines. That is, each rotor moved independently, each according to its own state machine (defined as a Cayley graph).
Viewing each graph as a coroutine (expressed in code as switch and goto between cases, of the same or other switches), one gets to a continuous space (of graph points).
- If things were subroutines, he would have said: discrete space (or “finite” dimension”)
- Interesting to see comp sci in the rarefied language of pure intellectualusm (circa 1930).