↳ In-reply-to » I spent a fair amount of my spare time this week diving into some ancient computer science from the 1970s, 1980s and 1990s (!!!), specifically Dana Angluin's L* algorithm for learning a finite state machine from an oracle and Rivest & Shapire's followups and extensions. Quite beautiful work in my opinion.

@eaplmx@twtxt.net oh wow, I’d never heard of that L*. I suppose such a short name is bound to be reused.

I was thinking about Dana Angluin’s algorithm, from 1987. Ancient computer science. The kind that youngsters ought to be taught, but rarely are.