{"id":821,"date":"2013-06-23T14:56:21","date_gmt":"2013-06-23T14:56:21","guid":{"rendered":"http:\/\/asc-cybernetics.org\/2013\/?page_id=821"},"modified":"2013-06-23T14:56:21","modified_gmt":"2013-06-23T14:56:21","slug":"loet-leydesdorffs-paper-proposal","status":"publish","type":"page","link":"https:\/\/asc-cybernetics.org\/2013\/?page_id=821","title":{"rendered":"Loet Leydesdorff&#8217;s Paper Proposal"},"content":{"rendered":"<p><center><\/p>\n<h3>Mutual Redundancies in Inter-human Communication Systems:  Steps Towards a Calculus of Processing Meaning<\/h3>\n<p><\/center><br \/>\n<center><strong>Co-author(s): Inga A. Ivanova<\/strong><\/center><br \/>\n<i>The study of inter-human communication requires a more complex framework than Shannon\u2019s (1948) mathematical theory of communication because \u201cinformation\u201d is defined in the latter case as meaningless uncertainty. The conference theme of \u201cacting, learning, understanding\u201d adds a reflexive layer of meaning processing to Shannon\u2019s linear scheme of \u201csending, channel, receiving.\u201d This reflexive layer operates non-linearly; meaning can be provided to the information from the perspective of hindsight, and with reference to other possible meanings. \u201cA difference that makes a difference\u201d to a system of reference presumes the systems of reference to be differently positioned in addition to being related in the Shannon-type communication. Providing information with meaning may also reduce the uncertainty that prevails.<\/p>\n<p>Assuming that meaning cannot be communicated, we extend Shannon\u2019s theory by defining mutual redundancy as a positional counterpart of the relational communication of information. Mutual redundancy indicates the surplus of meanings that can be provided to the exchanges in reflexive communications. The information is redundant because based on \u201cpure sets,\u201d that is, without subtraction of mutual information in the overlaps. We show that in the three-dimensional case (e.g., of a Triple Helix of university-industry-government relations), mutual redundancy is equal to mutual information (Rxyz = Txyz); but when the dimensionality is even, the sign is different. We generalize to the measurement in N dimensions and proceed to the interpretation. <\/p>\n<p>Using Luhmann\u2019s social-systems theory and\/or Giddens\u2019 structuration theory, mutual redundancy can be provided with an interpretation in the sociological case: different meaning-processing structures code and decode with other algorithms. A surplus of (\u201cabsent\u201d) options can then be generated that add to the redundancy. Luhmann\u2019s \u201cfunctional (sub)systems\u201d of expectations or Giddens\u2019 \u201crule-resource sets\u201d are positioned mutually, but coupled operationally in events or \u201cinstantiated\u201d in actions. Shannon-type information is generated by the mediation, but the \u201cstructures\u201d are (re-)positioned towards one another as sets of (potentially counterfactual) expectations. The positional differences among the coding and decoding algorithms provide a source of additional options in reflexive and anticipatory communications.<br \/>\n<\/i><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Mutual Redundancies in Inter-human Communication Systems: Steps Towards a Calculus of Processing Meaning Co-author(s): Inga A. Ivanova The study of inter-human communication requires a more complex framework than Shannon\u2019s (1948) mathematical theory of communication because \u201cinformation\u201d is defined in the latter case as meaningless uncertainty. The conference theme of \u201cacting, learning, understanding\u201d adds a reflexive &hellip; <\/p>\n<p><a class=\"more-link btn\" href=\"https:\/\/asc-cybernetics.org\/2013\/?page_id=821\">Continue reading<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":113,"menu_order":0,"comment_status":"open","ping_status":"open","template":"participants_only.php","meta":{"footnotes":""},"class_list":["post-821","page","type-page","status-publish","hentry","nodate","item-wrap"],"_links":{"self":[{"href":"https:\/\/asc-cybernetics.org\/2013\/index.php?rest_route=\/wp\/v2\/pages\/821","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/asc-cybernetics.org\/2013\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/asc-cybernetics.org\/2013\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/asc-cybernetics.org\/2013\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/asc-cybernetics.org\/2013\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=821"}],"version-history":[{"count":1,"href":"https:\/\/asc-cybernetics.org\/2013\/index.php?rest_route=\/wp\/v2\/pages\/821\/revisions"}],"predecessor-version":[{"id":822,"href":"https:\/\/asc-cybernetics.org\/2013\/index.php?rest_route=\/wp\/v2\/pages\/821\/revisions\/822"}],"up":[{"embeddable":true,"href":"https:\/\/asc-cybernetics.org\/2013\/index.php?rest_route=\/wp\/v2\/pages\/113"}],"wp:attachment":[{"href":"https:\/\/asc-cybernetics.org\/2013\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=821"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}