4 ms·
Learn O(f(n)) notation and caches, and you're good to go. Judging by interviews, they don't teach the caches part in CS.
by ncmncm 5y ago
Learn O(f(n)) notation and caches, and you're good to go. Judging by interviews, they don't teach the caches part in CS.
- coldpie 5y agoTurns out DFAs and Turing machines don't have caches. Wow, what incredibly useful models to spend several semesters examining /s
- ncmncm 5y agoComputer Science has "science" right there in the name: it isn't meant to be useful. But caches are DFAs. So, sometimes it is, by accident.
- anonymoushn 5y agoIs that about memoization, software fixed-size caches, physical caches on CPU dies, or caches that you can put in front of HTTP servers?
- ncmncm 5y agoYes. And many others. If you want to do science of computation, halting problem, P?=?NP, lambda calculus, good. Those are legitimate to study, and to write papers about. But studying them does not prepare you to engineer systems.