user51442

Interesting historical piece from George Forsythe: http://i.stanford.edu/pub/cstr/reports/cs/tr/66/40/CS-TR-66-...

That was weird: an hour ago I was reading "Version Control with Git" about merging and thinking "Hey, this is all just category theory", I then have a look at HN, and see this.

Nice compendium of results.

I hope the misspelling of "Isaac Newton" doesn't indicate errors elsewhere.

Heidegger doesn't seem too far from the mark, judging by Andy Clark's 1997 "Being There":

http://www2.econ.iastate.edu/tesfatsi/BeingThere.AClark1998....

The title even seems to be a nod to Heidegger's "dasein" (as well as to Woody Allen).

Or Heidegger, 'being-in-the-world-with-others' & all that.

Don't forget the Calkin-Wilf tree: http://www.cs.nott.ac.uk/~psarb2/MPC/RecountingRationalsTwic...

Nice. An interesting challenge for someone on Shadertoy.

"foo" occurs in the lyrics to Cab Calloway's 1939 Jumpin' Jive, as in this clip, also featuring fabulous tap dancing from the Nicholas Brothers: https://www.youtube.com/watch?v=_8yGGtVKrD8

I should add that I have no affiliation with mathsgear, in fact, I was unaware of their existence until just now. They seem to have lots of nice stuff: https://mathsgear.co.uk/collections/shapes

Just has to be face-transitive or isohedral for dice: https://en.wikipedia.org/wiki/Isohedral_figure

For example: https://mathsgear.co.uk/products/d120-dice

Continued fraction approximations p/q have |x-p/q| < 1/q²

Roger Zelazny? He gives an amusing account of him and Delany signing each others books here: http://www.tor.com/2016/05/26/a-few-more-words-from-roger-ze...

And in 3 dimensions it's points and planes that are dual - and finding the line between two points or the common line of two planes can now be done in a similar way, but using Plücker coordinates for the lines instead.

The Universe is two's complement. Item 154 of HAKMEM: http://catb.org/jargon/html/H/HAKMEM.html

Pi is ARM of course, but +1 for AVR. 6809 was nice too.

I'd have thought AVR assembler was a better choice these days - a nice orthogonal 8-bit RISC architecture, and you can use gcc, gas etc. (as well as being able to run your code on an Arduino).

Well, the optimizations are pretty smart to be sure, the stupid thing is that anything over 12! overflows (as GlitchMr points out).

I'd like to know how the recursion to iteration step was done.

A simple recursive factorial function:

https://godbolt.org/g/97dUFg

Not sure if that's smart or stupid.

I assume you mean Jim Norton (and Marcella Riordan):

https://www.youtube.com/watch?v=k-apGqB98RI

There is a rather fine (abridged) audio book of Finnegans Wake by Jim Norton (Bishop Brennan in Father Ted), some of which is on Youtube:

https://www.youtube.com/watch?v=5Ks60VrtJ4Y

It took quite a while for Lisp to get "proper" lexical closures - not until Scheme & CL in the 1980s really, see, for example:

http://www.paulgraham.com/thist.html

..as well as "Structured Programming with go to Statements".

The "premature optimization" quote is from Knuth's Turing Award lecture:

http://delivery.acm.org/10.1145/370000/361612/a1974-knuth.pd...

"The real problem is that programmers have spent far too much time worrying about efficiency in the wrong places and at the wrong times; premature optimization is the root of all evil (or at least most of it) in programming."

Years ago I worked on an SML parser that used LR tables, on errors (ie. with no valid transition) it would try to find a symbol to insert/delete/modify that would allow parsing to continue. It dealt reasonably well with simple errors, though ML syntax is a bit flexible - function application is juxtaposition and it has user-defined infix operators (to deal with them, the parser would resolve reduce-reduce and reduce-shift conflicts dynamically by calling a function at runtime).

Code is here, in fact:

https://github.com/Ravenbrook/mlworks/blob/master/src/parser...