Re:Things That Turbo Pascal Is Smaller Than (2011)
by atiedebee on Sunday November 15, 2026 @05:41PM
(#50511640)
Complexity is not something to strive for, but something to be avoided. I would also argue that we aren't good at managing that complexity at all.
Re:Things That Turbo Pascal Is Smaller Than (2011)
by ttoinou on Sunday November 15, 2026 @11:16PM
(#50513963)
We do software for people.
Engineers who complain about accidental complexity need to show that this complexity doesn’t come from the real world
Re:Things That Turbo Pascal Is Smaller Than (2011)
by Timwi on Monday November 16, 2026 @03:57AM
(#50515504)
I think the issue isn't with the comparison itself, but with the conclusion drawn. Pascal compiler is smaller than `touch`, therefore Pascal compiler was amazingly efficient and `touch` is super bloated.
I think a better conclusion is that the Pascal compiler was very limited and modern `touch` is very feature-rich (many comments in this thread have explained how) and it shows that we've come a long way.
If you actually used that Pascal compiler from the 80s, you'd immediately notice the limitations.
Re:Things That Turbo Pascal Is Smaller Than (2011)
by t43562 on Monday November 16, 2026 @04:19AM
(#50515613)
Turbo pascal was incredibly impactful - it gave lots of people like me an efficient compiler in an IDE with a superb graphics library (BGI) and superb compile speeds and one didn't need to swap floppy disks to compile. It was an amazing learning tool.
Touch, on my 1980s computer, would have been seen as a caricature. It would have been a 200 byte .com file back then, if that. The comparison is about what you can do with what you have if you have no other choice, and how plentiful resources don't automatically create empowering outcomes.
Bytes have history, meaning, context of creation, different utilities and different cost associated with creation/transfer/storage/manipulation
We could also use those comparisons to praise how complicated our current world has become and how good we are at managing such complexity