<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Which complexity?</title>
	<atom:link href="http://weblog.tetradian.com/2009/10/03/which-complexity/feed/" rel="self" type="application/rss+xml" />
	<link>http://weblog.tetradian.com/2009/10/03/which-complexity/?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=which-complexity</link>
	<description>Random ramblings over the metaphoric edge</description>
	<lastBuildDate>Tue, 22 May 2012 05:34:17 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Tom G</title>
		<link>http://weblog.tetradian.com/2009/10/03/which-complexity/comment-page-1/#comment-31937</link>
		<dc:creator>Tom G</dc:creator>
		<pubDate>Mon, 05 Oct 2009 07:05:38 +0000</pubDate>
		<guid isPermaLink="false">http://weblog.tomgraves.org/?p=355#comment-31937</guid>
		<description>Thanks, Lars.

Roger&#039;s version of &#039;complexity&#039; is a common usage, and often the only usage for many IT-folks, in the conventional Aristotelian true/false logic of the _internals_ of most software. But it becomes problematic as soon as we hit complexity in the Cynefin sense, such as in social-complexity or the social/technical interface.

So Roger&#039;s description is not &#039;wrong&#039;: it _is_ a good approach to take as long as you&#039;re dealing only with the subset of the context constrained _within_ the IT/software-only boundary - in effect, an idealised if very complicated &#039;world&#039;. Just not so good an approach for dealing with the rest of the real-world outside of those rather artificial bounds, where the radically different rules for true complexity (in the Cynefin sense) would apply.</description>
		<content:encoded><![CDATA[<p>Thanks, Lars.</p>
<p>Roger&#8217;s version of &#8216;complexity&#8217; is a common usage, and often the only usage for many IT-folks, in the conventional Aristotelian true/false logic of the _internals_ of most software. But it becomes problematic as soon as we hit complexity in the Cynefin sense, such as in social-complexity or the social/technical interface.</p>
<p>So Roger&#8217;s description is not &#8216;wrong&#8217;: it _is_ a good approach to take as long as you&#8217;re dealing only with the subset of the context constrained _within_ the IT/software-only boundary &#8211; in effect, an idealised if very complicated &#8216;world&#8217;. Just not so good an approach for dealing with the rest of the real-world outside of those rather artificial bounds, where the radically different rules for true complexity (in the Cynefin sense) would apply.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Lars Hansen</title>
		<link>http://weblog.tetradian.com/2009/10/03/which-complexity/comment-page-1/#comment-31914</link>
		<dc:creator>Lars Hansen</dc:creator>
		<pubDate>Sat, 03 Oct 2009 14:47:37 +0000</pubDate>
		<guid isPermaLink="false">http://weblog.tomgraves.org/?p=355#comment-31914</guid>
		<description>Good point. 

I have found the work of Roger Sessions to be interesting. But as someone who have an interest in systems thinking, complexity science and the Cynefin framework, I have been a bit puzzled as to his definition of complexity.</description>
		<content:encoded><![CDATA[<p>Good point. </p>
<p>I have found the work of Roger Sessions to be interesting. But as someone who have an interest in systems thinking, complexity science and the Cynefin framework, I have been a bit puzzled as to his definition of complexity.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

