Earlier quoted context omitted.
> A Turing-complete language is just that, Turing-complete. It sounds like you're dismissing Turing complete languages as basically the same. I think that's kind of like saying all hardware and networking is just made out of electric circuits. It's true, but it's not illuminating. > Sorting used to be hard. It used to be novel. It used to be something you could study Quicksort was created in 1959 [0], Heapsort in 196…
It does support my argument. Unless you want to quibble about exact times and how 1959 isn't "the 70s". Before 1959, Quicksort was novel. After that, it was something you were expected to know. Knowledge builds on knowledge. I don't have to invent heapsort. I can just study the implementation. It's now part of the common knowledge we're supposed to have. And if you think programming is just as sophisticated today as…
I always thought so too, but this discussion makes me think otherwise.