bear8642

Less focused but enjoyed Eddie Woo's and 3blue1brown's more recent videos on Youtube

Also challenged by Tom Duff's trigonometry page - http://www.iq0.com/notes/trig.html

Enjoy learning how to derive identities and equations from first principles - quite like differential of x^2 => 2x and the quadratic eqn via completing the square

as is Plan 9's Sam - jumping beyond the Command Line ;)

Pat Cadigan's book Fools has some truly bending sections

Feel Pat Cadigan's work might be a candidate, but agree

>important predecessors

Don't know enough about it but feel missing Simula from your list

Glad this got traction - had Dave Whiteland as lecturer last year. He's really into Tapirs!

Cool - thought had operator confused

>*(c ? &x : &y) = v;

Do you know why need to use pointer magic here?

Tried (c ? x : y) = v; and wondering why that doesn't work.

That's Bitwise Xor not exponentiation.

2^3 => 1

5^2 => 7

Clever! Though feel having "No" relate to x = 0 is slightly clearer

>return (char *[]){"No", "Yes"}[!!x];

Is !!x equivalent to x here?

Good point - didn't think that through enough before recommending.

Just thought of as nice tiling editor.

Rob Pike's Acme editor is another powerful tiling editor you can check out.

Nice tool! By DNF and KNF do you mean disjunctive and conjuctive normal form?

why not just click on the link? - seems more work to run this

Also appears quote missing in second code block

looking here https://en.cppreference.com/w/c/language/bit_field seems quite a bit. My main thought was how field's laid out in memory. Know would be big change with endianness but thought a standard check might be useful...?

>clean up the spec

Would this involve further specification of bitfields? Feel implementation defined nature of bitfields limits potential

Also known as a Pan Galactic Gargle Blaster

Could you elaborate why Racket? Not an implementation I've used.

>The facts of which bits do what -- which are embodied in that code -- are not protected (or protectable!), and can be reused freely.

Though given Oracle's current legal proceedings that might change...

None taken - agree Forth's slightly older language.

Hopcroft Ullman's Introduction to Automata Theory, Languages and Computation has good section on state machines and their connection to Regular Expressions

Forth is still alive and kicking!

For those not in the know

SICP = Structure and Interpretation of Computer Programs

PAIP = Paradigms of AI Programming

Dickens' novels were most definitely compiled from newspapers - that's part of the reason for some unnecessarily verbose sentences

>I just wonder if one day we'll be using systems with 4tb of ram that would be snappier if upgraded to 8tb or 16tb.

Can't find but feel there's a quote like "Programs will grow to fill memory"

Thank you - very succinct explanation.

Hadn't come across register files before and research confused me.

Could you explain the register file section please? - Don't understand that.

Thanks

Could you explain why that's true? - get that it works but don't understand why

> Octal is where it's really at

Why octal, not hex?