bear8642

Feel this is part of why I enjoy Acme more than emacs as everything just connects

> (G)roff looks like it's aimed at paper outputs first

Indeed - seem to remember (?Brian) comment one journal turned down a paper due to how well typeset is was believing it'd been printed elsewhere before

Wasn't there variant of this Doug McIlroy won by getting core below attack limit?

>only two hard problems in Computer Science".

You mean cache invalidation and naming things? :)

>If you can justify one more …

Reminds me of Terry Pratchett quote "No excuses. No excuses at all. Once you had a good excuse, you opened the door to bad excuses.”

Full quote is fifth here: <https://www.goodreads.com/work/quotes/819104-thud>

Yet to experience proper work life, but really enjoyed Brook's The Mythical Man-Month

> both of the them were real …

Well, Mel's story is definitely real!

You mean no function prototypes or just the idea that declarations defaulted to int?

Only used ANSI so wondering what excellence of K&R C mean

>I don't understand why they makes me type out the "@outlook.com" part at login.

Probably due to that's not the only address they support still - I've got a hotmail.co.uk account and outlook login page for me.

Another thought is universities and other groups use outlook as their MX signing in via outlook.com which can then redirect

> so pointers seemed "obvious"

Indeed - having come from low level route, never really understood why people get so confused with them

> To code used to mean (1) translating a message into a coded form

This is probably where the verb form originates - translating the assembly or higher level ideas into the binary required for the computational engines of the past

Feel this mental model approach is part of the appeal of Scheme and SICP as you start with simple replace model but near the end (still exploring chapters 4,5) you get shown how to build an interpreter which forces you to know how it all works because otherwise it doesn't.

Feel that's sentiment get more now - it's *not* magic but the fact that everything works given it's all illusions is magical

Still approx. zero, but seL4 kernel's written in C and proven correct preventing many security holes memory control prevents

could you provide a link? Having trouble finding

>Or books on fundamentals…

Abelson, Sussman's Structure Interpretation of Computer Programs also good recommend - helps show that whilst it's not magic, fact everything still works is magical

could you explain why it's meant to be so important?

Heard little about it and tried reading start but didn't seem very groundbreaking

> the realm of insight

Definitely helped understand in place quicksort and need to swap pivot value.

For those still confused remember the invariants

Start with:[????????????p?????], end with:[|<=p|p|>p|]

Partition via:[p|<=p|???|>p] (pivot|less than or equal to pivot|untested values|greater than pivot).

Giving: [|p|<=p|>p|]

pivot|less than or equal pivot|greater than. This requires swapping pivot at end of partition step

and a small one at that - less to think about trying to show idea

Remember seeing someone did videos last year exploring APL solutions.

Not sure if doing again, but could be useful resource

>Performance is comparable

Can't find links now, but fairly certain were stories in past about how switching to AWK from other tools increased performance

K&R C definitely has exercises (solutions available at <https://clc-wiki.net/wiki/K%26R2_solutions>) - final one of chapter 1 is write bracket matcher

> when it makes its way to other operating systems.

know you're referring to browser, but an OS - I think Oberon - had desktop as much larger than screen leading to ability to zoom around and create piles of windows

fascinating how our bodies can adapt.

deep shame community lost

think might be at end of this one <https://www.youtube.com/watch?v=7aXbh9VUB3U> though there's a few he's done recently on USB spec

Thanks for blog, very useful analogy.

With the odd/even detection section, do you know why the bytes aren't also small to big in Little Endian? That is why isn't the one's bit the leftmost bit?

> I then resort to the state of the art bubble sort

Remember reading Bentley's Programming Pearls and fairly sure that's what he starts Sorting section with a short implementation of

Not sure how achievable to find but the Canon Cat with it's leap keys, the FORTH based everything executable system and its supposed inability to loose user input always seemed really interesting

T (opposite of NIL) also existed <https://en.m.wikipedia.org/wiki/T_(programming_language)>

from my small experience with K and its links with APL would imagine that it becomes intuitive once learnt.

Don't know DSL ability, though aware someone wrote expanders from symbols to words, - imagine DSL doable but forth, lisp macros spring to mind first in the DSL space

Probably best to buy from official raspi reseller - form at bottom of <https://www.raspberrypi.org/products/raspberry-pi-4-model-b/> with links given specs