Continuous Groups From Turing

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).

  1. If things were subroutines, he would have said: discrete space (or “finite” dimension”)
  2. Interesting to see comp sci in the rarefied language of pure intellectualusm  (circa 1930).




Computer Programmer who often does network administration with focus on security servers. Very strong in Microsoft Azure cloud!
This entry was posted in coding theory. Bookmark the permalink.