3 ms·
I think there's a kind of naive reductionism that runs throughout CS. You can avoid complexity by ignoring it in the proverbial Dunning-Kruger kind of way - wh
by TheOtherHobbes 11y ago
I think there's a kind of naive reductionism that runs throughout CS.
You can avoid complexity by ignoring it in the proverbial Dunning-Kruger kind of way - where you don't know what you don't know, but you try to turn your toy misunderstanding of some domain into code anyway.
Or you can avoid it by creating over-systematised technologies that try to barricade "impure" unpredictability behind a big wall of abstraction and insider-only jargon.
They're both defensive moves against the messiness of the real world.
There may be other approaches that trade off accessibility with useful results in other ways.
- harveywi 11y agoThis "naive reductionism" looks to me like the difference between the way that analysts and algebraists work on problems [1]: "If I have to wave my hands and explain it, I would explain it like this. In algebra there are sequences of operations which have proven to be important and effective in one circumstance. Algebraists try to reuse these operations in different contexts in the hopes that what proved effective in one situation will be effective again. By contrast an analyst is likely to form an idiosyncratic mental model of specific problems. Based on that mental model you have intuitions that let you carry out long chains of calculations that are, in principle, obviously going to lead to the right thing. Typically your intuition is correct to within a constant factor, and you're only interested in some sort of limiting behavior so that is fine." How else is a person supposed to intelligently explore the solution space of a problem other than through some kind of "naive reductionism"? [1] http://bentilly.blogspot.com/2010/08/analysis-vs-algebra-predicts-eating.html http://bentilly.blogspot.com/2010/08/analysis-vs-algebra-pre...