[TUHS] Hypothetical: Could MULTICS have been written in C, if available?

[G. Branden Robinson via TUHS]

[self-follow-up to clarify]

At 2026-05-25T22:27:19-0500, G. Branden Robinson wrote:
> With misconception dispelled, cyclomatic complexity and Big-O notation
> proved to be a huge relief, and the subject came to more closely
> resemble the rest of my engineering education: look first at the
> lowest-order terms!

That might be unclear.  I mean the lowest-_degree_ terms, in the sense
that one constructs a Taylor polynomial to model the function
representing runtime or storage consumption.  Where the change in the
independent variable is near zero, as is routine in differential
analysis, higher-degree terms in the polynomial go to zero more quickly
than the lower-degree terms.

That clarification may not have been an improvement.  I know--I'll blame
the Sean Carroll book I'm reading.

Regards,
Branden
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 833 bytes
Desc: not available
URL: <http://www.tuhs.org/pipermail/tuhs/attachments/20260525/b20027f5/attachment.sig>