Hacker News new | ask | show | jobs
by larodi 752 days ago
Impressive also Knuth decided to represent the math as assembly for CLARITY. Sounds like a major blow to math notation when it comes to algorithms…
2 comments

His books are filled with assembly code. He created a machine and an assembly language to be vendor independent for his famous book series The Art Of Computer Programming. I first saw this in 1978 when I took data structures and I remember thinking that was a bit idiosyncratic even then.

Among all the things Professor Knuth is famous for is writing an Algol compiler for the Burroughs 205 in assembly on paper over one summer just after he graduated from college. There's a handwritten listing of it at the computer history museum. It's pretty interesting and shows off how he programmed and thought about programming in 1960-1961. It's probably not terribly different from how other people programmed back then but he was better at it than most.

https://www.computerhistory.org/collections/catalog/10272457...

And here is Paul Kimpel's story about how he got that compiler running (or at least limping) on his B205 emulator: https://datatron.blogspot.com/2015/11/knuths-algol-58-compil...
That was wonderful. That equipment is 2 or 3 generations older than my first experiences, but I remember some of the same fiddly nature when doing bare metal (well cross assembler) programming in the late 1970s on a TI-980B that had a card reader, tape, a small removable disk, and some sort of terminal. Maybe a silent 700? I don't quite remember. It was fun at the time.
Given that von Neumann had his name lent to "von Neumann regular" elements and rings (exercise: what, if any, is the relation to "regular expression"?), I suspect he could've come up with an algorithm notation that was both (a) exceedingly well suited to expressing FSM implementations, yet (b) inscrutable to all of us who grew up with assembly as a lingua franca.