82,891
edits
Template:Complicated capsule: Difference between revisions
no edit summary
Amwelladmin (talk | contribs) No edit summary Tags: Mobile edit Mobile web edit |
Amwelladmin (talk | contribs) No edit summary Tags: Mobile edit Mobile web edit |
||
| Line 3: | Line 3: | ||
For example chess — or, for that matter, any boardgame or sport. | For example chess — or, for that matter, any boardgame or sport. | ||
[[Complicated system]]s therefore benefit from skilled management and some [[subject matter expert|expertise]] to operate: a good chess player will do better than a poor one — a school leaver | [[Complicated system]]s therefore benefit from skilled management and some [[subject matter expert|expertise]] to operate: a good chess player will do better than a poor one — a [[school-leaver from Bucharest]] with plenty of coffee and a [[playbook]] on her lap probably isn’t the droid you’re looking for — but in the right hands can usually be managed without catastrophe, though the degree of success will be a function of user’s skill and expertise. | ||
You know you have a [[complicated system]] when it cleaves to a comprehensive set of axioms and rules, and thus it is a matter of making sure that the proper models are being used for the situation at hand. [[Chess]] and [[Alpha Go]] are [[Complicated system|complicated]], but not [[Complex systems|complex]], systems. You can “force-solve” them, at least in theory.<ref>Do you hear that, {{author|Daniel Susskind}}?</ref> They are entirely predictable, determinative and calculable, given enough processing power. They’re [[tame problem|tame]], ''not'' [[wicked problem]]s. | You know you have a [[complicated system]] when it cleaves to a comprehensive set of axioms and rules, and thus it is a matter of making sure that the proper models are being used for the situation at hand. [[Chess]] and [[Alpha Go]] are [[Complicated system|complicated]], but not [[Complex systems|complex]], systems. You can “force-solve” them, at least in theory.<ref>Do you hear that, {{author|Daniel Susskind}}?</ref> They are entirely predictable, determinative and calculable, given enough processing power. They’re [[tame problem|tame]], ''not'' [[wicked problem]]s. | ||