Fixed two long standing bugs in the line breaking algorithm in boxes and glue. I had to re-read the Knuth paper about optimum fit line breaking... Both fixes are in v0.2.18
Has anybody else noticed that Kyle Kulinski has *two* identical sets of 4 volumes of Knuth's the Art of Computer Programming, on his bookshelf that appears in the background of his videos?
Even if I don't think he has read them, that tells a lot about how analytical his mindset is, to have such interests!
(but why two?)
By the way, I warmly recommend his Youtube channel, "Secular Talk"!
I've read a couple of breathless articles about Donald #Knuth's use of #LLM systems, and found (unsurprisingly) that he has a paper about it, if you prefer your news without someone else's hot takes:
https://www-cs-faculty.stanford.edu/~knuth/papers/claude-cycles.pdf
(Sidebar: apparently he's working on *another* volume of #TAOCP? Good lord. I still haven't worked through the exercises in Vol. 1.)
Further human + AI + proof assistant work on Knuth's "Claude Cycles" problem
https://twitter.com/BoWang87/status/2037648937453232504
#HackerNews #Further #human #AI #proof #assistant #Knuth #Claude #Cycles

Three weeks ago I shared that Claude had shocked Prof. Donald Knuth by finding an odd-m construction for his open Hamiltonian decomposition problem in about an hour of guided exploration. Prof. Knuth titled the paper Claude’s Cycles. The story didn't end there. The updated
Knuth's merge-sort in C. Definitely in the style of mathematician programming.