|
|
|
|
|
|
by convolvatron
256 days ago
|
|
|
Yes. if the work is installing software and being on pager duty then we can really stop pretending that identifying O(nlog(n))is relevant. And if the job is to write a compiler optimizer, it's pretty important you know the basics of CS (like decidability). smashing these two together and pretending they are the same has been a huge source of cognitive dissonance in the industry and serves no one. |
|
|